{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZTOX62ZBVLETBZA5OKDMIEZS5Q","short_pith_number":"pith:ZTOX62ZB","schema_version":"1.0","canonical_sha256":"ccdd7f6b21aac930e41d7286c41332ec162f2d87a58c7325c311af9869497b06","source":{"kind":"arxiv","id":"1812.04380","version":2},"attestation_state":"computed","paper":{"title":"DRONE: a Distributed Subgraph-Centric Framework for Processing Large Scale Power-law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Haihang You, Shuai Zhang, Xiaole Wen","submitted_at":"2018-12-11T13:17:55Z","abstract_excerpt":"Nowadays, in the big data era, social networks, graph databases, knowledge graphs, electronic commerce etc. demand efficient and scalable capability to process an ever increasing volume of graph-structured data. To meet the challenge, two mainstream distributed programming models, vertex-centric (VC) and subgraph-centric (SC) were proposed. Compared to the VC model, the SC model converges faster with less communication overhead on well-partitioned graphs, and is easy to program due to the \"think like a graph\" philosophy. The edge-cut method is considered as a natural choice of subgraph-centric"},"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":"1812.04380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-11T13:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"be146e9344553fe7ed0a2bc5c3f6021ca229493a3b11ebc48f62216ed26933ce","abstract_canon_sha256":"3ede74feba511c74417b94601249e087264687015155eea3e3b6746178c529b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.707189Z","signature_b64":"bK69/ZlCKDEa9GThVHUroVvWTxkRn+uBzqpP2tS5P5qfvmqld0UDlZYSgfhoI0njiXoAx8SaEKEjHjFmp2/dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdd7f6b21aac930e41d7286c41332ec162f2d87a58c7325c311af9869497b06","last_reissued_at":"2026-05-17T23:56:40.706618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.706618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DRONE: a Distributed Subgraph-Centric Framework for Processing Large Scale Power-law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Haihang You, Shuai Zhang, Xiaole Wen","submitted_at":"2018-12-11T13:17:55Z","abstract_excerpt":"Nowadays, in the big data era, social networks, graph databases, knowledge graphs, electronic commerce etc. demand efficient and scalable capability to process an ever increasing volume of graph-structured data. To meet the challenge, two mainstream distributed programming models, vertex-centric (VC) and subgraph-centric (SC) were proposed. Compared to the VC model, the SC model converges faster with less communication overhead on well-partitioned graphs, and is easy to program due to the \"think like a graph\" philosophy. The edge-cut method is considered as a natural choice of subgraph-centric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04380","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":"1812.04380","created_at":"2026-05-17T23:56:40.706732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04380v2","created_at":"2026-05-17T23:56:40.706732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04380","created_at":"2026-05-17T23:56:40.706732+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTOX62ZBVLET","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTOX62ZBVLETBZA5","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTOX62ZB","created_at":"2026-05-18T12:33:07.085635+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/ZTOX62ZBVLETBZA5OKDMIEZS5Q","json":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q.json","graph_json":"https://pith.science/api/pith-number/ZTOX62ZBVLETBZA5OKDMIEZS5Q/graph.json","events_json":"https://pith.science/api/pith-number/ZTOX62ZBVLETBZA5OKDMIEZS5Q/events.json","paper":"https://pith.science/paper/ZTOX62ZB"},"agent_actions":{"view_html":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q","download_json":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q.json","view_paper":"https://pith.science/paper/ZTOX62ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04380&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTOX62ZBVLETBZA5OKDMIEZS5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTOX62ZBVLETBZA5OKDMIEZS5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q/action/storage_attestation","attest_author":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q/action/author_attestation","sign_citation":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q/action/citation_signature","submit_replication":"https://pith.science/pith/ZTOX62ZBVLETBZA5OKDMIEZS5Q/action/replication_record"}},"created_at":"2026-05-17T23:56:40.706732+00:00","updated_at":"2026-05-17T23:56:40.706732+00:00"}