{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IOWPKB2BPMSAAJZN5LBKCTP2AV","short_pith_number":"pith:IOWPKB2B","schema_version":"1.0","canonical_sha256":"43acf507417b2400272deac2a14dfa056994503fd27defae2c7de5d7576dfeb8","source":{"kind":"arxiv","id":"1804.08487","version":2},"attestation_state":"computed","paper":{"title":"Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Corrie Jacobien Carstens, Dorothea Wagner, Hung Tran, Manuel Penschuck, Michael Hamann, Ulrich Meyer","submitted_at":"2018-04-23T15:06:07Z","abstract_excerpt":"Graph randomisation is a crucial task in the analysis and synthesis of networks. It is typically implemented as an edge switching process (ESMC) repeatedly swapping the nodes of random edge pairs while maintaining the degrees involved. Curveball is a novel approach that instead considers the whole neighbourhoods of randomly drawn node pairs. Its Markov chain converges to a uniform distribution, and experiments suggest that it requires less steps than the established ESMC.\n  Since trades however are more expensive, we study Curveball's practical runtime by introducing the first efficient Curveb"},"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":"1804.08487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T15:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"034d82b203bb0d1b21d8ad188ae807876072e330d373d997003f0b691063c53f","abstract_canon_sha256":"af32b0d093e38dbe661bdc42484ae03796c588827839059ace7eb217b998e2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.154385Z","signature_b64":"TiXUeaiEqbMJyoUnWLGFbmIRSsN0230SBbwE9mlcXJSR4It0nqRo+xZrQS2n/rg6UfQyWS54lYTwSr2IU+J7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43acf507417b2400272deac2a14dfa056994503fd27defae2c7de5d7576dfeb8","last_reissued_at":"2026-05-18T00:07:55.153646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.153646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Corrie Jacobien Carstens, Dorothea Wagner, Hung Tran, Manuel Penschuck, Michael Hamann, Ulrich Meyer","submitted_at":"2018-04-23T15:06:07Z","abstract_excerpt":"Graph randomisation is a crucial task in the analysis and synthesis of networks. It is typically implemented as an edge switching process (ESMC) repeatedly swapping the nodes of random edge pairs while maintaining the degrees involved. Curveball is a novel approach that instead considers the whole neighbourhoods of randomly drawn node pairs. Its Markov chain converges to a uniform distribution, and experiments suggest that it requires less steps than the established ESMC.\n  Since trades however are more expensive, we study Curveball's practical runtime by introducing the first efficient Curveb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08487","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":"1804.08487","created_at":"2026-05-18T00:07:55.153758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08487v2","created_at":"2026-05-18T00:07:55.153758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08487","created_at":"2026-05-18T00:07:55.153758+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOWPKB2BPMSA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOWPKB2BPMSAAJZN","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOWPKB2B","created_at":"2026-05-18T12:32:31.084164+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/IOWPKB2BPMSAAJZN5LBKCTP2AV","json":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV.json","graph_json":"https://pith.science/api/pith-number/IOWPKB2BPMSAAJZN5LBKCTP2AV/graph.json","events_json":"https://pith.science/api/pith-number/IOWPKB2BPMSAAJZN5LBKCTP2AV/events.json","paper":"https://pith.science/paper/IOWPKB2B"},"agent_actions":{"view_html":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV","download_json":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV.json","view_paper":"https://pith.science/paper/IOWPKB2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08487&json=true","fetch_graph":"https://pith.science/api/pith-number/IOWPKB2BPMSAAJZN5LBKCTP2AV/graph.json","fetch_events":"https://pith.science/api/pith-number/IOWPKB2BPMSAAJZN5LBKCTP2AV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV/action/storage_attestation","attest_author":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV/action/author_attestation","sign_citation":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV/action/citation_signature","submit_replication":"https://pith.science/pith/IOWPKB2BPMSAAJZN5LBKCTP2AV/action/replication_record"}},"created_at":"2026-05-18T00:07:55.153758+00:00","updated_at":"2026-05-18T00:07:55.153758+00:00"}