{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3BUGX33AJOV3QN3AYEU335TWZ5","short_pith_number":"pith:3BUGX33A","schema_version":"1.0","canonical_sha256":"d8686bef604babb83760c129bdf676cf5a94ce964da27c22818c1aef5b94f979","source":{"kind":"arxiv","id":"1604.04772","version":2},"attestation_state":"computed","paper":{"title":"Abstract Graph Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lumsdaine, Marcin Zalewski, Thejaka Amila Kanewala","submitted_at":"2016-04-16T16:26:29Z","abstract_excerpt":"An Abstract Graph Machine(AGM) is an abstract model for distributed memory parallel stabilizing graph algorithms. A stabilizing algorithm starts from a particular initial state and goes through series of different state changes until it converges. The AGM adds work dependency to the stabilizing algorithm. The work is processed within the processing function. All processes in the system execute the same processing function. Before feeding work into the processing function, work is ordered using a strict weak ordering relation. The strict weak ordering relation divides work into equivalence clas"},"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":"1604.04772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-16T16:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"4f79fcdbc9341c7bc9a5d4b77449a21b619406d79f85ded5d8f1c1b844686470","abstract_canon_sha256":"adfd98466d89bf00c021de6595b8601f02425eb6edbe406dfed47c6e61c5850b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:04.707053Z","signature_b64":"jho8X2WjnGWkVAqcGYtZooqmRvCNy2jipFFkyEDsrDtzWIX/pIh7Vf8QJfC+E9xItVKZGXWGCstBPVSeFuJQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8686bef604babb83760c129bdf676cf5a94ce964da27c22818c1aef5b94f979","last_reissued_at":"2026-05-18T01:16:04.706255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:04.706255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstract Graph Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lumsdaine, Marcin Zalewski, Thejaka Amila Kanewala","submitted_at":"2016-04-16T16:26:29Z","abstract_excerpt":"An Abstract Graph Machine(AGM) is an abstract model for distributed memory parallel stabilizing graph algorithms. A stabilizing algorithm starts from a particular initial state and goes through series of different state changes until it converges. The AGM adds work dependency to the stabilizing algorithm. The work is processed within the processing function. All processes in the system execute the same processing function. Before feeding work into the processing function, work is ordered using a strict weak ordering relation. The strict weak ordering relation divides work into equivalence clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04772","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":"1604.04772","created_at":"2026-05-18T01:16:04.706408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04772v2","created_at":"2026-05-18T01:16:04.706408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04772","created_at":"2026-05-18T01:16:04.706408+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BUGX33AJOV3","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BUGX33AJOV3QN3A","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BUGX33A","created_at":"2026-05-18T12:29:55.572404+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/3BUGX33AJOV3QN3AYEU335TWZ5","json":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5.json","graph_json":"https://pith.science/api/pith-number/3BUGX33AJOV3QN3AYEU335TWZ5/graph.json","events_json":"https://pith.science/api/pith-number/3BUGX33AJOV3QN3AYEU335TWZ5/events.json","paper":"https://pith.science/paper/3BUGX33A"},"agent_actions":{"view_html":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5","download_json":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5.json","view_paper":"https://pith.science/paper/3BUGX33A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04772&json=true","fetch_graph":"https://pith.science/api/pith-number/3BUGX33AJOV3QN3AYEU335TWZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/3BUGX33AJOV3QN3AYEU335TWZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5/action/storage_attestation","attest_author":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5/action/author_attestation","sign_citation":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5/action/citation_signature","submit_replication":"https://pith.science/pith/3BUGX33AJOV3QN3AYEU335TWZ5/action/replication_record"}},"created_at":"2026-05-18T01:16:04.706408+00:00","updated_at":"2026-05-18T01:16:04.706408+00:00"}