{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LR6W4CALPRCZGI3YSG2663TDOG","short_pith_number":"pith:LR6W4CAL","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"},"canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","source":{"kind":"arxiv","id":"1404.6561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6561","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6561v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6561","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"LR6W4CALPRCZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LR6W4CALPRCZGI3Y","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LR6W4CAL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LR6W4CALPRCZGI3YSG2663TDOG","target":"record","payload":{"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"},"canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","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"},"source_kind":"arxiv","source_id":"1404.6561","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G63VVyt6/B3Mii1hXoeMXEFNgqHRPqdAN4PDu2KaQuw/fFlEXZ2IVRlvAEuLozvLclS1ZaNWQIkczyuEzBsFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:41:00.750611Z"},"content_sha256":"b5c9fd4f8877df01ea8c940a03a520d348e274cdb977f39e9f21cb8445ecc2d1","schema_version":"1.0","event_id":"sha256:b5c9fd4f8877df01ea8c940a03a520d348e274cdb977f39e9f21cb8445ecc2d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LR6W4CALPRCZGI3YSG2663TDOG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j530gHRk2YJK59YPveET7RsAr9XZzYsfRp8/CzE5yFiCMsuu4Kn+CVLnry9uMS1VEUI72UlOFyld14lfy/M4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:41:00.751219Z"},"content_sha256":"14d28557a1c2530e613342968ab5231c2c462170a70a95be325c998f1ba45486","schema_version":"1.0","event_id":"sha256:14d28557a1c2530e613342968ab5231c2c462170a70a95be325c998f1ba45486"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/bundle.json","state_url":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR6W4CALPRCZGI3YSG2663TDOG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T11:41:00Z","links":{"resolver":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG","bundle":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/bundle.json","state":"https://pith.science/pith/LR6W4CALPRCZGI3YSG2663TDOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR6W4CALPRCZGI3YSG2663TDOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LR6W4CALPRCZGI3YSG2663TDOG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"787b861f10e594d887ca7faa5445a21e7739022e896155be43e639d06cb4d631","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-25T21:28:14Z","title_canon_sha256":"7bb3ba58a5d6483ef6df42321a1b5980ae990ac4c09610408f23dd2fbf53f85a"},"schema_version":"1.0","source":{"id":"1404.6561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6561","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6561v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6561","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"LR6W4CALPRCZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LR6W4CALPRCZGI3Y","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LR6W4CAL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:14d28557a1c2530e613342968ab5231c2c462170a70a95be325c998f1ba45486","target":"graph","created_at":"2026-05-18T01:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Chen Avin, David Peleg, Michael Borokhovich, Zvi Lotker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-25T21:28:14Z","title":"Distributed Computing on Core-Periphery Networks: Axiom-based Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6561","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b5c9fd4f8877df01ea8c940a03a520d348e274cdb977f39e9f21cb8445ecc2d1","target":"record","created_at":"2026-05-18T01:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"787b861f10e594d887ca7faa5445a21e7739022e896155be43e639d06cb4d631","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-25T21:28:14Z","title_canon_sha256":"7bb3ba58a5d6483ef6df42321a1b5980ae990ac4c09610408f23dd2fbf53f85a"},"schema_version":"1.0","source":{"id":"1404.6561","kind":"arxiv","version":2}},"canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7d6e080b7c4593237891b5ef6e6371ba00bb046a01beab6520f646f2e33962","first_computed_at":"2026-05-18T01:33:07.812577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.812577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOU10XvpSVxxoLlQel4t6qK6ONlfCF6ke7yqv6AZlF6/H8mz478bKFXWM4XQkoMGhuer6hmF3vOroyasfPhcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.812963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c9fd4f8877df01ea8c940a03a520d348e274cdb977f39e9f21cb8445ecc2d1","sha256:14d28557a1c2530e613342968ab5231c2c462170a70a95be325c998f1ba45486"],"state_sha256":"0f4cc1e04a4fc9b079d41a9e4dda4c147fe43bb5ce56004fa8e335a29e8562e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNt87tpp3q8zcXQaW7lk4J1iiR7aoXYtjgdsQnxg/zy2bi4/fQNdgiZAtNYLEFN4deG4LU3ZitnbzmHYklcXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:41:00.754430Z","bundle_sha256":"ed469d3486f9b6dee7c67fd4183e42b342424075976a92f700e75bb9062ecf19"}}