{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PU24DDSF33DTV37XD5EF36L6VP","short_pith_number":"pith:PU24DDSF","schema_version":"1.0","canonical_sha256":"7d35c18e45dec73aeff71f485df97eabfcb4c3bc0b6e462163b1d1562c1ac8f4","source":{"kind":"arxiv","id":"2305.04716","version":2},"attestation_state":"computed","paper":{"title":"A dynamical approach to spanning and surplus edges of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Josu\\'e Corujo, Vlada Limic","submitted_at":"2023-05-08T14:02:06Z","abstract_excerpt":"Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous breadth-first-walk introduced by Limic (2019) is extended in order to account for the surplus edge data in addition to the spanning edge data. Two different graph-based representations of the multiplicative coalescent, with different advantages and drawbacks, are discussed in detail. A canonical multi-graph from Bhamidi, Budhiraja and Wang (2014) naturally emerges. The prese"},"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":"2305.04716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-05-08T14:02:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2ed9e0caddf82ee219a95e5a337d500f4ec09167b37ae2492dd0cf23a418d310","abstract_canon_sha256":"4cf14307fddf80811887b12ceab2675180dadcbfa48745f1521db1a8364b886a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:24.489630Z","signature_b64":"V0S8RswHeRVhh6XyhRf7pqh6QV5SGkfXFeWxZ2NhHGLgrpxTc795flfWx7cfCIAgNk7GXDuKq5dwwD19s2W6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d35c18e45dec73aeff71f485df97eabfcb4c3bc0b6e462163b1d1562c1ac8f4","last_reissued_at":"2026-07-05T07:10:24.489119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:24.489119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dynamical approach to spanning and surplus edges of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Josu\\'e Corujo, Vlada Limic","submitted_at":"2023-05-08T14:02:06Z","abstract_excerpt":"Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous breadth-first-walk introduced by Limic (2019) is extended in order to account for the surplus edge data in addition to the spanning edge data. Two different graph-based representations of the multiplicative coalescent, with different advantages and drawbacks, are discussed in detail. A canonical multi-graph from Bhamidi, Budhiraja and Wang (2014) naturally emerges. The prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.04716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.04716","created_at":"2026-07-05T07:10:24.489181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04716v2","created_at":"2026-07-05T07:10:24.489181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04716","created_at":"2026-07-05T07:10:24.489181+00:00"},{"alias_kind":"pith_short_12","alias_value":"PU24DDSF33DT","created_at":"2026-07-05T07:10:24.489181+00:00"},{"alias_kind":"pith_short_16","alias_value":"PU24DDSF33DTV37X","created_at":"2026-07-05T07:10:24.489181+00:00"},{"alias_kind":"pith_short_8","alias_value":"PU24DDSF","created_at":"2026-07-05T07:10:24.489181+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.06380","citing_title":"The number of connected components in sub-critical random graph processes","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP","json":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP.json","graph_json":"https://pith.science/api/pith-number/PU24DDSF33DTV37XD5EF36L6VP/graph.json","events_json":"https://pith.science/api/pith-number/PU24DDSF33DTV37XD5EF36L6VP/events.json","paper":"https://pith.science/paper/PU24DDSF"},"agent_actions":{"view_html":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP","download_json":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP.json","view_paper":"https://pith.science/paper/PU24DDSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04716&json=true","fetch_graph":"https://pith.science/api/pith-number/PU24DDSF33DTV37XD5EF36L6VP/graph.json","fetch_events":"https://pith.science/api/pith-number/PU24DDSF33DTV37XD5EF36L6VP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP/action/storage_attestation","attest_author":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP/action/author_attestation","sign_citation":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP/action/citation_signature","submit_replication":"https://pith.science/pith/PU24DDSF33DTV37XD5EF36L6VP/action/replication_record"}},"created_at":"2026-07-05T07:10:24.489181+00:00","updated_at":"2026-07-05T07:10:24.489181+00:00"}