{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BNMI2M3YOXKC5UUSCJ7TESMLZS","short_pith_number":"pith:BNMI2M3Y","schema_version":"1.0","canonical_sha256":"0b588d337875d42ed292127f32498bccb9c02b2ec52b9d26168977ef0a1829fb","source":{"kind":"arxiv","id":"1403.6270","version":1},"attestation_state":"computed","paper":{"title":"Distributed Edge Partitioning for Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alberto Montresor, Alessio Guerrieri","submitted_at":"2014-03-25T09:38:12Z","abstract_excerpt":"The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased.\n  Appropriately partitioning the graph as a preprocessing step can improve the degree of parallelism of its analysis. A number of heuristic algorithms have been developed to solve this problem, but many of them subdivide the graph on its vertex set, thus obtaining a vertex-partitioned graph.\n  Aim of this paper is to ex"},"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":"1403.6270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-25T09:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"2622d146166de1407b8afd57f8b273ae5ab5e47039c75216dbb3502b22ad3bc3","abstract_canon_sha256":"5a0f80b38893c906683fb9503d9b6742ddf41602d018b9bc7e0b04d5870551a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:37.356596Z","signature_b64":"y2SiqZMlNXPfAnW5bVYNo6XbXmLGSxXRhvXlIGXcnmPhfW1jwhlRo9WD57H6EDIxMuyBSdBEiTXoTaiRFlPpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b588d337875d42ed292127f32498bccb9c02b2ec52b9d26168977ef0a1829fb","last_reissued_at":"2026-05-18T02:55:37.355957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:37.355957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Edge Partitioning for Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alberto Montresor, Alessio Guerrieri","submitted_at":"2014-03-25T09:38:12Z","abstract_excerpt":"The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased.\n  Appropriately partitioning the graph as a preprocessing step can improve the degree of parallelism of its analysis. A number of heuristic algorithms have been developed to solve this problem, but many of them subdivide the graph on its vertex set, thus obtaining a vertex-partitioned graph.\n  Aim of this paper is to ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6270","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":"1403.6270","created_at":"2026-05-18T02:55:37.356064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6270v1","created_at":"2026-05-18T02:55:37.356064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6270","created_at":"2026-05-18T02:55:37.356064+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNMI2M3YOXKC","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNMI2M3YOXKC5UUS","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNMI2M3Y","created_at":"2026-05-18T12:28:22.404517+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/BNMI2M3YOXKC5UUSCJ7TESMLZS","json":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS.json","graph_json":"https://pith.science/api/pith-number/BNMI2M3YOXKC5UUSCJ7TESMLZS/graph.json","events_json":"https://pith.science/api/pith-number/BNMI2M3YOXKC5UUSCJ7TESMLZS/events.json","paper":"https://pith.science/paper/BNMI2M3Y"},"agent_actions":{"view_html":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS","download_json":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS.json","view_paper":"https://pith.science/paper/BNMI2M3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6270&json=true","fetch_graph":"https://pith.science/api/pith-number/BNMI2M3YOXKC5UUSCJ7TESMLZS/graph.json","fetch_events":"https://pith.science/api/pith-number/BNMI2M3YOXKC5UUSCJ7TESMLZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS/action/storage_attestation","attest_author":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS/action/author_attestation","sign_citation":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS/action/citation_signature","submit_replication":"https://pith.science/pith/BNMI2M3YOXKC5UUSCJ7TESMLZS/action/replication_record"}},"created_at":"2026-05-18T02:55:37.356064+00:00","updated_at":"2026-05-18T02:55:37.356064+00:00"}