{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TMXYZNJZIPU56DQR2SM75DFUAG","short_pith_number":"pith:TMXYZNJZ","schema_version":"1.0","canonical_sha256":"9b2f8cb53943e9df0e11d499fe8cb4018698303de7dc79e15ee1c922cae6d7f0","source":{"kind":"arxiv","id":"1706.05760","version":1},"attestation_state":"computed","paper":{"title":"Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lumsdaine, Marcin Zalewski, Martina Barnas, Thejaka Kanewala","submitted_at":"2017-06-19T01:33:37Z","abstract_excerpt":"Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed to converge to a legitimate state.Those algorithms are not directly amenable to solving distributed graph processing problems when performance and scalability are important. In this paper, we show the \"Abstract Graph Machine\" (AGM) model that can be used to convert self-stabilizing algorithms into forms suitable for distributed graph processing. An AGM is a mathematical model of parallel computation on graphs that add"},"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":"1706.05760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-19T01:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"2357bed984843fc05ae1fa41d76a14109908fbe582700068012cfe9936960324","abstract_canon_sha256":"627574fb747bfeae4dd547ff44f3927be74a7e84206791923201c77a1c0b4564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.978935Z","signature_b64":"bIp6YZRjuUHhqMmRpp/LWTW6a+A0je6DGUrF21FaaGtN49356+F6D/txIq7+QkkUqklQdgxZ+xhOZK2x9DebDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b2f8cb53943e9df0e11d499fe8cb4018698303de7dc79e15ee1c922cae6d7f0","last_reissued_at":"2026-05-18T00:42:08.978508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.978508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lumsdaine, Marcin Zalewski, Martina Barnas, Thejaka Kanewala","submitted_at":"2017-06-19T01:33:37Z","abstract_excerpt":"Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed to converge to a legitimate state.Those algorithms are not directly amenable to solving distributed graph processing problems when performance and scalability are important. In this paper, we show the \"Abstract Graph Machine\" (AGM) model that can be used to convert self-stabilizing algorithms into forms suitable for distributed graph processing. An AGM is a mathematical model of parallel computation on graphs that add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05760","kind":"arxiv","version":1},"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":"1706.05760","created_at":"2026-05-18T00:42:08.978568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05760v1","created_at":"2026-05-18T00:42:08.978568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05760","created_at":"2026-05-18T00:42:08.978568+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMXYZNJZIPU5","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMXYZNJZIPU56DQR","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMXYZNJZ","created_at":"2026-05-18T12:31:46.661854+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/TMXYZNJZIPU56DQR2SM75DFUAG","json":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG.json","graph_json":"https://pith.science/api/pith-number/TMXYZNJZIPU56DQR2SM75DFUAG/graph.json","events_json":"https://pith.science/api/pith-number/TMXYZNJZIPU56DQR2SM75DFUAG/events.json","paper":"https://pith.science/paper/TMXYZNJZ"},"agent_actions":{"view_html":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG","download_json":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG.json","view_paper":"https://pith.science/paper/TMXYZNJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05760&json=true","fetch_graph":"https://pith.science/api/pith-number/TMXYZNJZIPU56DQR2SM75DFUAG/graph.json","fetch_events":"https://pith.science/api/pith-number/TMXYZNJZIPU56DQR2SM75DFUAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG/action/storage_attestation","attest_author":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG/action/author_attestation","sign_citation":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG/action/citation_signature","submit_replication":"https://pith.science/pith/TMXYZNJZIPU56DQR2SM75DFUAG/action/replication_record"}},"created_at":"2026-05-18T00:42:08.978568+00:00","updated_at":"2026-05-18T00:42:08.978568+00:00"}