{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6V6FB6MDTZYPNE2KP33A3MP2DR","short_pith_number":"pith:6V6FB6MD","schema_version":"1.0","canonical_sha256":"f57c50f9839e70f6934a7ef60db1fa1c59b1bd1f5ec5c561d011e51251cd08a4","source":{"kind":"arxiv","id":"1507.04405","version":1},"attestation_state":"computed","paper":{"title":"Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gregory Madey, Robert Ryan McCune, Tim Weninger","submitted_at":"2015-07-15T22:14:23Z","abstract_excerpt":"The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of standard machines are not well-supported by popular Big Data tools like MapReduce, which are notoriously poor-performing for iterative graph algorithms such as PageRank. In response, a new type of framework challenges one to Think Like A Vertex (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph. Such an "},"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":"1507.04405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T22:14:23Z","cross_cats_sorted":[],"title_canon_sha256":"37f963e3d91aadc3a6a4e32273db4cd6f19c0055eb9651ad7dbe1a3f0ff7975c","abstract_canon_sha256":"bdd82e964dbc8478a16b42038d1e09fccdd367ebc812fa2bf7478c0abec8866a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.514339Z","signature_b64":"AsuwgkWA0cj9JWdKXKEnl78CCk71w6S+Cg57KJwnqQt7/XlkkgVq4NKWpyl0Q3Hrp5UYx3RSMvM1fGUIx0FfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f57c50f9839e70f6934a7ef60db1fa1c59b1bd1f5ec5c561d011e51251cd08a4","last_reissued_at":"2026-05-18T01:36:47.513756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.513756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gregory Madey, Robert Ryan McCune, Tim Weninger","submitted_at":"2015-07-15T22:14:23Z","abstract_excerpt":"The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of standard machines are not well-supported by popular Big Data tools like MapReduce, which are notoriously poor-performing for iterative graph algorithms such as PageRank. In response, a new type of framework challenges one to Think Like A Vertex (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph. Such an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04405","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":"1507.04405","created_at":"2026-05-18T01:36:47.513840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04405v1","created_at":"2026-05-18T01:36:47.513840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04405","created_at":"2026-05-18T01:36:47.513840+00:00"},{"alias_kind":"pith_short_12","alias_value":"6V6FB6MDTZYP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6V6FB6MDTZYPNE2K","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6V6FB6MD","created_at":"2026-05-18T12:29:07.941421+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/6V6FB6MDTZYPNE2KP33A3MP2DR","json":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR.json","graph_json":"https://pith.science/api/pith-number/6V6FB6MDTZYPNE2KP33A3MP2DR/graph.json","events_json":"https://pith.science/api/pith-number/6V6FB6MDTZYPNE2KP33A3MP2DR/events.json","paper":"https://pith.science/paper/6V6FB6MD"},"agent_actions":{"view_html":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR","download_json":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR.json","view_paper":"https://pith.science/paper/6V6FB6MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04405&json=true","fetch_graph":"https://pith.science/api/pith-number/6V6FB6MDTZYPNE2KP33A3MP2DR/graph.json","fetch_events":"https://pith.science/api/pith-number/6V6FB6MDTZYPNE2KP33A3MP2DR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR/action/storage_attestation","attest_author":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR/action/author_attestation","sign_citation":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR/action/citation_signature","submit_replication":"https://pith.science/pith/6V6FB6MDTZYPNE2KP33A3MP2DR/action/replication_record"}},"created_at":"2026-05-18T01:36:47.513840+00:00","updated_at":"2026-05-18T01:36:47.513840+00:00"}