{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LR6W4CALPRCZGI3YSG2663TDOG","short_pith_number":"pith:LR6W4CAL","schema_version":"1.0","canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","source":{"kind":"arxiv","id":"1404.6561","version":2},"attestation_state":"computed","paper":{"title":"Distributed Computing on Core-Periphery Networks: Axiom-based Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chen Avin, David Peleg, Michael Borokhovich, Zvi Lotker","submitted_at":"2014-04-25T21:28:14Z","abstract_excerpt":"Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of "},"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":"1404.6561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-25T21:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"7bb3ba58a5d6483ef6df42321a1b5980ae990ac4c09610408f23dd2fbf53f85a","abstract_canon_sha256":"787b861f10e594d887ca7faa5445a21e7739022e896155be43e639d06cb4d631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.812963Z","signature_b64":"vOU10XvpSVxxoLlQel4t6qK6ONlfCF6ke7yqv6AZlF6/H8mz478bKFXWM4XQkoMGhuer6hmF3vOroyasfPhcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","last_reissued_at":"2026-05-18T01:33:07.812577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.812577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computing on Core-Periphery Networks: Axiom-based Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chen Avin, David Peleg, Michael Borokhovich, Zvi Lotker","submitted_at":"2014-04-25T21:28:14Z","abstract_excerpt":"Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6561","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":"1404.6561","created_at":"2026-05-18T01:33:07.812635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6561v2","created_at":"2026-05-18T01:33:07.812635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6561","created_at":"2026-05-18T01:33:07.812635+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR6W4CALPRCZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR6W4CALPRCZGI3Y","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR6W4CAL","created_at":"2026-05-18T12:28:38.356838+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/LR6W4CALPRCZGI3YSG2663TDOG","json":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG.json","graph_json":"https://pith.science/api/pith-number/LR6W4CALPRCZGI3YSG2663TDOG/graph.json","events_json":"https://pith.science/api/pith-number/LR6W4CALPRCZGI3YSG2663TDOG/events.json","paper":"https://pith.science/paper/LR6W4CAL"},"agent_actions":{"view_html":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG","download_json":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG.json","view_paper":"https://pith.science/paper/LR6W4CAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6561&json=true","fetch_graph":"https://pith.science/api/pith-number/LR6W4CALPRCZGI3YSG2663TDOG/graph.json","fetch_events":"https://pith.science/api/pith-number/LR6W4CALPRCZGI3YSG2663TDOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/action/storage_attestation","attest_author":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/action/author_attestation","sign_citation":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/action/citation_signature","submit_replication":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/action/replication_record"}},"created_at":"2026-05-18T01:33:07.812635+00:00","updated_at":"2026-05-18T01:33:07.812635+00:00"}