{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QEHARI676MWXMZQCUOJ6TQEHCO","short_pith_number":"pith:QEHARI67","schema_version":"1.0","canonical_sha256":"810e08a3dff32d766602a393e9c08713a3f530b055e1fa9d1e2d649572d6d4e3","source":{"kind":"arxiv","id":"1512.03532","version":1},"attestation_state":"computed","paper":{"title":"Fast Generation of Spatially Embedded Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Eric Parsonage, Matthew Roughan","submitted_at":"2015-12-11T05:53:00Z","abstract_excerpt":"Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast generation of these networks. Existing techniques are $O(n^2)$ where $n$ is the number of nodes in the graph. In this paper we present an $O(n + e)$ algorithm, where $e$ is the number of edges."},"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":"1512.03532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-11T05:53:00Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4bd94d52a2651736f00c7b3681b65fbbe391aa5bcc3b16e764e1a44738551ba0","abstract_canon_sha256":"1fead47e207bca25748a182ffe4278ba88171de97b2654c271a7c0484d9d237a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:32.189879Z","signature_b64":"4aW58ambqMXfOYiB2lw1N71n4SYzmGL2IC+NZijrDBKCPTWqvDuplXSAuXuwEgGAy+IFDVF10b9NHPNqvvwFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"810e08a3dff32d766602a393e9c08713a3f530b055e1fa9d1e2d649572d6d4e3","last_reissued_at":"2026-05-18T01:24:32.189240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:32.189240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Generation of Spatially Embedded Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Eric Parsonage, Matthew Roughan","submitted_at":"2015-12-11T05:53:00Z","abstract_excerpt":"Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast generation of these networks. Existing techniques are $O(n^2)$ where $n$ is the number of nodes in the graph. In this paper we present an $O(n + e)$ algorithm, where $e$ is the number of edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03532","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":"1512.03532","created_at":"2026-05-18T01:24:32.189339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03532v1","created_at":"2026-05-18T01:24:32.189339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03532","created_at":"2026-05-18T01:24:32.189339+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEHARI676MWX","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEHARI676MWXMZQC","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEHARI67","created_at":"2026-05-18T12:29:37.295048+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/QEHARI676MWXMZQCUOJ6TQEHCO","json":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO.json","graph_json":"https://pith.science/api/pith-number/QEHARI676MWXMZQCUOJ6TQEHCO/graph.json","events_json":"https://pith.science/api/pith-number/QEHARI676MWXMZQCUOJ6TQEHCO/events.json","paper":"https://pith.science/paper/QEHARI67"},"agent_actions":{"view_html":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO","download_json":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO.json","view_paper":"https://pith.science/paper/QEHARI67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03532&json=true","fetch_graph":"https://pith.science/api/pith-number/QEHARI676MWXMZQCUOJ6TQEHCO/graph.json","fetch_events":"https://pith.science/api/pith-number/QEHARI676MWXMZQCUOJ6TQEHCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO/action/storage_attestation","attest_author":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO/action/author_attestation","sign_citation":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO/action/citation_signature","submit_replication":"https://pith.science/pith/QEHARI676MWXMZQCUOJ6TQEHCO/action/replication_record"}},"created_at":"2026-05-18T01:24:32.189339+00:00","updated_at":"2026-05-18T01:24:32.189339+00:00"}