{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MNS3KBX4I3CG2NLMQHFNETPZKK","short_pith_number":"pith:MNS3KBX4","schema_version":"1.0","canonical_sha256":"6365b506fc46c46d356c81cad24df9529e8af91bb39f4494543b342ba2f3084f","source":{"kind":"arxiv","id":"1606.03244","version":2},"attestation_state":"computed","paper":{"title":"Simple epistemic planning: generalised gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Herzig, Faustine Maffre, Fr\\'ed\\'eric Maris, Martin C. Cooper, Pierre R\\'egnier","submitted_at":"2016-06-10T09:31:26Z","abstract_excerpt":"The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols. We extend the gossip problem to arbitrary epistemic depths. For example, we may require not only that all agents know all secrets but also that all agents know that all agents know all secrets. We give optimal protocols for various versions of the generalised gossip problem, depending on the graph of communication links, in the case of two-way communications, one-way communication"},"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":"1606.03244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T09:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"d34ef1b00b1f923aa790f5af983195f7f1f1d1f8e2b5385da91395b5b1567148","abstract_canon_sha256":"ec4bda72110645146007bc19e2df83a88ee0b5780df35d0b803ebde20a4c60d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:26.113861Z","signature_b64":"aVC9D5JQGpjhsD4RjoUuuXSvDkLIbAvWpuN89d2V6jpeWvjhrOuuCbeFYX+kZYr+PFrjhjJlWgcXGaxzaTfvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6365b506fc46c46d356c81cad24df9529e8af91bb39f4494543b342ba2f3084f","last_reissued_at":"2026-05-18T01:12:26.113543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:26.113543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple epistemic planning: generalised gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Herzig, Faustine Maffre, Fr\\'ed\\'eric Maris, Martin C. Cooper, Pierre R\\'egnier","submitted_at":"2016-06-10T09:31:26Z","abstract_excerpt":"The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols. We extend the gossip problem to arbitrary epistemic depths. For example, we may require not only that all agents know all secrets but also that all agents know that all agents know all secrets. We give optimal protocols for various versions of the generalised gossip problem, depending on the graph of communication links, in the case of two-way communications, one-way communication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03244","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":"1606.03244","created_at":"2026-05-18T01:12:26.113591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03244v2","created_at":"2026-05-18T01:12:26.113591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03244","created_at":"2026-05-18T01:12:26.113591+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNS3KBX4I3CG","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNS3KBX4I3CG2NLM","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNS3KBX4","created_at":"2026-05-18T12:30:32.724797+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/MNS3KBX4I3CG2NLMQHFNETPZKK","json":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK.json","graph_json":"https://pith.science/api/pith-number/MNS3KBX4I3CG2NLMQHFNETPZKK/graph.json","events_json":"https://pith.science/api/pith-number/MNS3KBX4I3CG2NLMQHFNETPZKK/events.json","paper":"https://pith.science/paper/MNS3KBX4"},"agent_actions":{"view_html":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK","download_json":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK.json","view_paper":"https://pith.science/paper/MNS3KBX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03244&json=true","fetch_graph":"https://pith.science/api/pith-number/MNS3KBX4I3CG2NLMQHFNETPZKK/graph.json","fetch_events":"https://pith.science/api/pith-number/MNS3KBX4I3CG2NLMQHFNETPZKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK/action/storage_attestation","attest_author":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK/action/author_attestation","sign_citation":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK/action/citation_signature","submit_replication":"https://pith.science/pith/MNS3KBX4I3CG2NLMQHFNETPZKK/action/replication_record"}},"created_at":"2026-05-18T01:12:26.113591+00:00","updated_at":"2026-05-18T01:12:26.113591+00:00"}