{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P63G6LWMBCZIR5T3TAOGVC6E7G","short_pith_number":"pith:P63G6LWM","schema_version":"1.0","canonical_sha256":"7fb66f2ecc08b288f67b981c6a8bc4f99d4a3dcadedc8f36385163c6096f6ecc","source":{"kind":"arxiv","id":"1710.07565","version":3},"attestation_state":"computed","paper":{"title":"Communication-free Massively Distributed Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DC","authors_text":"Christian Schulz, Daniel Funke, Darren Strash, Manuel Penschuck, Moritz von Looz, Peter Sanders, Sebastian Lamm, Ulrich Meyer","submitted_at":"2017-10-20T15:10:59Z","abstract_excerpt":"Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis and an extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly~available~datasets.\n  Network generators serve as a tool to alleviate this problem by providing synthetic instances with controllable parameters. However, many network generators fail to provide instances on a massive scale due to their sequential nature or resource constraints. Additionally, truly scalable"},"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":"1710.07565","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T15:10:59Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"4ae5692f8f324ca2bc40801ac127d8be26dad50b48cc777bf5c8acdedf79bf51","abstract_canon_sha256":"53c50ded98c64332e616eb0f50fb9db1d0940cc304d038d6b24c76febbae7539"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:06.208039Z","signature_b64":"0L6StuXgbKEDwSqy6AjO1bpwA/P0zIlvRhfwLX7+VA/6Ad+fEyaW3zdfnrIU75iwxI/+FYBCrG+iEFM6lw8rBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb66f2ecc08b288f67b981c6a8bc4f99d4a3dcadedc8f36385163c6096f6ecc","last_reissued_at":"2026-05-17T23:51:06.207433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:06.207433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-free Massively Distributed Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DC","authors_text":"Christian Schulz, Daniel Funke, Darren Strash, Manuel Penschuck, Moritz von Looz, Peter Sanders, Sebastian Lamm, Ulrich Meyer","submitted_at":"2017-10-20T15:10:59Z","abstract_excerpt":"Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis and an extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly~available~datasets.\n  Network generators serve as a tool to alleviate this problem by providing synthetic instances with controllable parameters. However, many network generators fail to provide instances on a massive scale due to their sequential nature or resource constraints. Additionally, truly scalable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07565","kind":"arxiv","version":3},"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":"1710.07565","created_at":"2026-05-17T23:51:06.207519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07565v3","created_at":"2026-05-17T23:51:06.207519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07565","created_at":"2026-05-17T23:51:06.207519+00:00"},{"alias_kind":"pith_short_12","alias_value":"P63G6LWMBCZI","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P63G6LWMBCZIR5T3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P63G6LWM","created_at":"2026-05-18T12:31:37.085036+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/P63G6LWMBCZIR5T3TAOGVC6E7G","json":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G.json","graph_json":"https://pith.science/api/pith-number/P63G6LWMBCZIR5T3TAOGVC6E7G/graph.json","events_json":"https://pith.science/api/pith-number/P63G6LWMBCZIR5T3TAOGVC6E7G/events.json","paper":"https://pith.science/paper/P63G6LWM"},"agent_actions":{"view_html":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G","download_json":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G.json","view_paper":"https://pith.science/paper/P63G6LWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07565&json=true","fetch_graph":"https://pith.science/api/pith-number/P63G6LWMBCZIR5T3TAOGVC6E7G/graph.json","fetch_events":"https://pith.science/api/pith-number/P63G6LWMBCZIR5T3TAOGVC6E7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G/action/storage_attestation","attest_author":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G/action/author_attestation","sign_citation":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G/action/citation_signature","submit_replication":"https://pith.science/pith/P63G6LWMBCZIR5T3TAOGVC6E7G/action/replication_record"}},"created_at":"2026-05-17T23:51:06.207519+00:00","updated_at":"2026-05-17T23:51:06.207519+00:00"}