{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CTOXFYVKG7PRUEQTJS2LDAIAAW","short_pith_number":"pith:CTOXFYVK","schema_version":"1.0","canonical_sha256":"14dd72e2aa37df1a12134cb4b18100059d47a35169c0c6116e0517251e2e3631","source":{"kind":"arxiv","id":"2009.03747","version":2},"attestation_state":"computed","paper":{"title":"Connectedness matters: Construction and exact random sampling of connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"physics.soc-ph","authors_text":"Carl D. Modes, Szabolcs Horv\\'at","submitted_at":"2020-09-08T13:37:47Z","abstract_excerpt":"We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are two of the most commonly needed ones when constructing null models for the practical analysis of physical or biological networks. Yet handling these constraints, let alone combining them, is non-trivial. Our method builds on a recently introduced novel sampling approach that constructs graphs with given degrees independently (unlike edge-switching Markov Cha"},"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":"2009.03747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2020-09-08T13:37:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b6f0e4bcdeb594b44f7a0c53d08e51fb4491405f264cd3853122e5c84bc41173","abstract_canon_sha256":"9a78eccbbcebd9181615c0b25e6351fe9d12b6f18bc8a26013534c6ba65b6436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:31.482046Z","signature_b64":"aQ9vHPUN9huGidp1jbBgE7j9szQhbdXIRzf+VyCO87ZjkvecPhs/Q0rP16kJVSltyeMBURX0422sGKLkdfG4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14dd72e2aa37df1a12134cb4b18100059d47a35169c0c6116e0517251e2e3631","last_reissued_at":"2026-07-05T01:56:31.481620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:31.481620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectedness matters: Construction and exact random sampling of connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"physics.soc-ph","authors_text":"Carl D. Modes, Szabolcs Horv\\'at","submitted_at":"2020-09-08T13:37:47Z","abstract_excerpt":"We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are two of the most commonly needed ones when constructing null models for the practical analysis of physical or biological networks. Yet handling these constraints, let alone combining them, is non-trivial. Our method builds on a recently introduced novel sampling approach that constructs graphs with given degrees independently (unlike edge-switching Markov Cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03747","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/2009.03747/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":"2009.03747","created_at":"2026-07-05T01:56:31.481677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.03747v2","created_at":"2026-07-05T01:56:31.481677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03747","created_at":"2026-07-05T01:56:31.481677+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTOXFYVKG7PR","created_at":"2026-07-05T01:56:31.481677+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTOXFYVKG7PRUEQT","created_at":"2026-07-05T01:56:31.481677+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTOXFYVK","created_at":"2026-07-05T01:56:31.481677+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/CTOXFYVKG7PRUEQTJS2LDAIAAW","json":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW.json","graph_json":"https://pith.science/api/pith-number/CTOXFYVKG7PRUEQTJS2LDAIAAW/graph.json","events_json":"https://pith.science/api/pith-number/CTOXFYVKG7PRUEQTJS2LDAIAAW/events.json","paper":"https://pith.science/paper/CTOXFYVK"},"agent_actions":{"view_html":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW","download_json":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW.json","view_paper":"https://pith.science/paper/CTOXFYVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.03747&json=true","fetch_graph":"https://pith.science/api/pith-number/CTOXFYVKG7PRUEQTJS2LDAIAAW/graph.json","fetch_events":"https://pith.science/api/pith-number/CTOXFYVKG7PRUEQTJS2LDAIAAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW/action/storage_attestation","attest_author":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW/action/author_attestation","sign_citation":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW/action/citation_signature","submit_replication":"https://pith.science/pith/CTOXFYVKG7PRUEQTJS2LDAIAAW/action/replication_record"}},"created_at":"2026-07-05T01:56:31.481677+00:00","updated_at":"2026-07-05T01:56:31.481677+00:00"}