arXiv (All)
open access
Task-Oriented Boolean Function Computation: Practical Code Constructions
Task-oriented communication conveys information that is necessary for downstream tasks. For binary decision tasks, this paradigm is information-theoretically formalized by Boolean function computation (BFC) via channels, where the receiver aims to determine the value of a function unknown to the tra
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Function-Correcting Codes in the Lee Metric#1104871
- Construction of cryptographically important Boolean functions#334468
- The reach of a verification tool decides its value: A controlled study of verification surface, artifact quality, and cost in AI coding agents#622630
- RIC VERIFY_ Deterministic Decision Verification Infrastructure#108055
- Code as Worlds: Agentic Discovery of Executable World Representations for Physical Reasoning#626297
Record · ID 1156500
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive