{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V2DA57ZI3HNPIL5NPLMHHGZHKI","short_pith_number":"pith:V2DA57ZI","schema_version":"1.0","canonical_sha256":"ae860eff28d9daf42fad7ad8739b27520ff25837d3e579697eed98cff3bcc1a4","source":{"kind":"arxiv","id":"1803.03042","version":2},"attestation_state":"computed","paper":{"title":"Some Problems in Compact Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Computer Science, Amitabh Trehan (2) ((1) Instituto de Matem\\'aticas, Armando Casta\\~neda (1), Jonas Lef\\`evre (2), Loughborough University, Mexico, UK), UNAM","submitted_at":"2018-03-08T11:20:08Z","abstract_excerpt":"This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal memory as compared to the number of their possible neighbours implying that a node may not be able to store all the IDs of its neighbours. These algorithms are useful for large networks of small devices such as the Internet of Things, for wireless or ad-hoc networks, and, in general, as memory efficient algorithms. We introduce the Compact Message Passing(CMP) mo"},"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":"1803.03042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-08T11:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"266b981518c36fa6c67066a36db1913be66ad24c1fc98497fb484ca73b7a7693","abstract_canon_sha256":"c2f0c58c975f2f6eb2297d9d83383ff6b28d2047b3cd8bd5b46e2bb76fb96167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.493209Z","signature_b64":"UzsuyW5jhLU7j9PMIObDfG7h/+BlAx4+RjURcTBQxAmHtyED468yWbTXk8lCQ9vWGK9f3iHIHeV5Cl+o5lRaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae860eff28d9daf42fad7ad8739b27520ff25837d3e579697eed98cff3bcc1a4","last_reissued_at":"2026-05-18T00:15:36.492499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.492499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Problems in Compact Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Computer Science, Amitabh Trehan (2) ((1) Instituto de Matem\\'aticas, Armando Casta\\~neda (1), Jonas Lef\\`evre (2), Loughborough University, Mexico, UK), UNAM","submitted_at":"2018-03-08T11:20:08Z","abstract_excerpt":"This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal memory as compared to the number of their possible neighbours implying that a node may not be able to store all the IDs of its neighbours. These algorithms are useful for large networks of small devices such as the Internet of Things, for wireless or ad-hoc networks, and, in general, as memory efficient algorithms. We introduce the Compact Message Passing(CMP) mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03042","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":"1803.03042","created_at":"2026-05-18T00:15:36.492615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03042v2","created_at":"2026-05-18T00:15:36.492615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03042","created_at":"2026-05-18T00:15:36.492615+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2DA57ZI3HNP","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2DA57ZI3HNPIL5N","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2DA57ZI","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05801","citing_title":"Self-Correcting Gossip Protocols","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI","json":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI.json","graph_json":"https://pith.science/api/pith-number/V2DA57ZI3HNPIL5NPLMHHGZHKI/graph.json","events_json":"https://pith.science/api/pith-number/V2DA57ZI3HNPIL5NPLMHHGZHKI/events.json","paper":"https://pith.science/paper/V2DA57ZI"},"agent_actions":{"view_html":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI","download_json":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI.json","view_paper":"https://pith.science/paper/V2DA57ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03042&json=true","fetch_graph":"https://pith.science/api/pith-number/V2DA57ZI3HNPIL5NPLMHHGZHKI/graph.json","fetch_events":"https://pith.science/api/pith-number/V2DA57ZI3HNPIL5NPLMHHGZHKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI/action/storage_attestation","attest_author":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI/action/author_attestation","sign_citation":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI/action/citation_signature","submit_replication":"https://pith.science/pith/V2DA57ZI3HNPIL5NPLMHHGZHKI/action/replication_record"}},"created_at":"2026-05-18T00:15:36.492615+00:00","updated_at":"2026-05-18T00:15:36.492615+00:00"}