{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CLFMDB4Z4QYCGRQ7TLLKTG2TVQ","short_pith_number":"pith:CLFMDB4Z","schema_version":"1.0","canonical_sha256":"12cac18799e43023461f9ad6a99b53ac1aab8b248bf4a113279deedd4b7de4a1","source":{"kind":"arxiv","id":"1501.03028","version":2},"attestation_state":"computed","paper":{"title":"Knowledge in Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jia Tao, Pavel Naumov","submitted_at":"2015-01-13T15:01:47Z","abstract_excerpt":"The paper investigates epistemic properties of information flow under communication protocols with a given topological structure of the communication network. The main result is a sound and complete logical system that describes all such properties. The system consists of a variation of the multi-agent epistemic logic S5 extended by a new network-specific Gateway axiom."},"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":"1501.03028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-13T15:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b93d4e5acda8cdeb13c76e06ed41fef733cc3a644c25ff8e406ff2cfb7f7d43","abstract_canon_sha256":"d5ab5efc4349a3c7932cd854f371a849df1e6c414c6497b377d93cbf3f0b6451"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:54.510435Z","signature_b64":"0hAyNkwdUOajgEkjfHt1mJN3wH+p4KIkUlGNVbvywBdtXVFiC8+qgPs6sRcEQCx/r0H8EjrEHulBZRpc+abFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12cac18799e43023461f9ad6a99b53ac1aab8b248bf4a113279deedd4b7de4a1","last_reissued_at":"2026-05-18T01:27:54.509744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:54.509744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge in Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jia Tao, Pavel Naumov","submitted_at":"2015-01-13T15:01:47Z","abstract_excerpt":"The paper investigates epistemic properties of information flow under communication protocols with a given topological structure of the communication network. The main result is a sound and complete logical system that describes all such properties. The system consists of a variation of the multi-agent epistemic logic S5 extended by a new network-specific Gateway axiom."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03028","kind":"arxiv","version":2},"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":"1501.03028","created_at":"2026-05-18T01:27:54.509847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03028v2","created_at":"2026-05-18T01:27:54.509847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03028","created_at":"2026-05-18T01:27:54.509847+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLFMDB4Z4QYC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLFMDB4Z4QYCGRQ7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLFMDB4Z","created_at":"2026-05-18T12:29:17.054201+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/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ","json":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ.json","graph_json":"https://pith.science/api/pith-number/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/graph.json","events_json":"https://pith.science/api/pith-number/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/events.json","paper":"https://pith.science/paper/CLFMDB4Z"},"agent_actions":{"view_html":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ","download_json":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ.json","view_paper":"https://pith.science/paper/CLFMDB4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03028&json=true","fetch_graph":"https://pith.science/api/pith-number/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/action/storage_attestation","attest_author":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/action/author_attestation","sign_citation":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/action/citation_signature","submit_replication":"https://pith.science/pith/CLFMDB4Z4QYCGRQ7TLLKTG2TVQ/action/replication_record"}},"created_at":"2026-05-18T01:27:54.509847+00:00","updated_at":"2026-05-18T01:27:54.509847+00:00"}