{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RWZYKJEWKWBFDGXIZGWRFUE7TX","short_pith_number":"pith:RWZYKJEW","schema_version":"1.0","canonical_sha256":"8db38524965582519ae8c9ad12d09f9dffc2a3aca9fff27c5ca3d70de2a08b02","source":{"kind":"arxiv","id":"1704.08931","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Rate Efficient Control of Distributed Discrete Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Ren, John MacLaren Walsh, Solmaz Torabi","submitted_at":"2017-04-28T13:50:12Z","abstract_excerpt":"A key issue in the control of distributed discrete systems modeled as Markov decisions processes, is that often the state of the system is not directly observable at any single location in the system. The participants in the control scheme must share information with one another regarding the state of the system in order to collectively make informed control decisions, but this information sharing can be costly. Harnessing recent results from information theory regarding distributed function computation, in this paper we derive, for several information sharing model structures, the minimum amo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.08931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-28T13:50:12Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"8e2b37ff19e30c4ca14a4035e7b10432304b23e7948be3ccb317b18d4aa426c5","abstract_canon_sha256":"f8b86a1f0845d3375e276999bd4687a9889626ed5fb5f125e07e1cff9b5a9de4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:24.960412Z","signature_b64":"Lgv4rhlWqxdtAXtKlcPwD891StJ2i62B7hLWV/E8LuNquwI8FlpJVx/sG9wTwWW8MHJVjURzck1xFlFEmCNvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8db38524965582519ae8c9ad12d09f9dffc2a3aca9fff27c5ca3d70de2a08b02","last_reissued_at":"2026-05-18T00:45:24.959907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:24.959907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Rate Efficient Control of Distributed Discrete Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Ren, John MacLaren Walsh, Solmaz Torabi","submitted_at":"2017-04-28T13:50:12Z","abstract_excerpt":"A key issue in the control of distributed discrete systems modeled as Markov decisions processes, is that often the state of the system is not directly observable at any single location in the system. The participants in the control scheme must share information with one another regarding the state of the system in order to collectively make informed control decisions, but this information sharing can be costly. Harnessing recent results from information theory regarding distributed function computation, in this paper we derive, for several information sharing model structures, the minimum amo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08931","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08931","created_at":"2026-05-18T00:45:24.959989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08931v1","created_at":"2026-05-18T00:45:24.959989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08931","created_at":"2026-05-18T00:45:24.959989+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWZYKJEWKWBF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWZYKJEWKWBFDGXI","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWZYKJEW","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX","json":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX.json","graph_json":"https://pith.science/api/pith-number/RWZYKJEWKWBFDGXIZGWRFUE7TX/graph.json","events_json":"https://pith.science/api/pith-number/RWZYKJEWKWBFDGXIZGWRFUE7TX/events.json","paper":"https://pith.science/paper/RWZYKJEW"},"agent_actions":{"view_html":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX","download_json":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX.json","view_paper":"https://pith.science/paper/RWZYKJEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08931&json=true","fetch_graph":"https://pith.science/api/pith-number/RWZYKJEWKWBFDGXIZGWRFUE7TX/graph.json","fetch_events":"https://pith.science/api/pith-number/RWZYKJEWKWBFDGXIZGWRFUE7TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX/action/storage_attestation","attest_author":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX/action/author_attestation","sign_citation":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX/action/citation_signature","submit_replication":"https://pith.science/pith/RWZYKJEWKWBFDGXIZGWRFUE7TX/action/replication_record"}},"created_at":"2026-05-18T00:45:24.959989+00:00","updated_at":"2026-05-18T00:45:24.959989+00:00"}