{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DKN4XZMEPR2ZODA2EVYWQ7DS6N","short_pith_number":"pith:DKN4XZME","schema_version":"1.0","canonical_sha256":"1a9bcbe5847c75970c1a2571687c72f35e4e8dfcf69d799ba77acdf1a5778dd9","source":{"kind":"arxiv","id":"1406.1197","version":3},"attestation_state":"computed","paper":{"title":"Unbiased sampling of network ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.ME","authors_text":"Diego Garlaschelli, Rossana Mastrandrea, Tiziano Squartini","submitted_at":"2014-06-04T20:05:22Z","abstract_excerpt":"Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. An important requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that match the enforced constraints exactly. Unfortunately, when applied to strongly heterogeneous networks (like most real-world examples), the majority of these approaches become biased and/or time-consuming. Moreover, the algorithms defined in the simple"},"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":"1406.1197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-04T20:05:22Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"d1ada4369927595363dd38871538b99fa2771387626fbf2d6376c57fe214f7db","abstract_canon_sha256":"1c0e5a52b113df33596056873f21d6c1d23353929a9a91d686877eacbd6068d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.434928Z","signature_b64":"xqtx2zmfOFfHn2qYRI0Aq0nZD/VpNRBblffc4i0hgNWIfb2LIX9NGVozDmqGcYIma5V2HlifCNamB6vPzEkUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a9bcbe5847c75970c1a2571687c72f35e4e8dfcf69d799ba77acdf1a5778dd9","last_reissued_at":"2026-05-18T02:26:45.434546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.434546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiased sampling of network ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.ME","authors_text":"Diego Garlaschelli, Rossana Mastrandrea, Tiziano Squartini","submitted_at":"2014-06-04T20:05:22Z","abstract_excerpt":"Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. An important requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that match the enforced constraints exactly. Unfortunately, when applied to strongly heterogeneous networks (like most real-world examples), the majority of these approaches become biased and/or time-consuming. Moreover, the algorithms defined in the simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1197","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":"1406.1197","created_at":"2026-05-18T02:26:45.434606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1197v3","created_at":"2026-05-18T02:26:45.434606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1197","created_at":"2026-05-18T02:26:45.434606+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKN4XZMEPR2Z","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKN4XZMEPR2ZODA2","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKN4XZME","created_at":"2026-05-18T12:28:25.294606+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/DKN4XZMEPR2ZODA2EVYWQ7DS6N","json":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N.json","graph_json":"https://pith.science/api/pith-number/DKN4XZMEPR2ZODA2EVYWQ7DS6N/graph.json","events_json":"https://pith.science/api/pith-number/DKN4XZMEPR2ZODA2EVYWQ7DS6N/events.json","paper":"https://pith.science/paper/DKN4XZME"},"agent_actions":{"view_html":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N","download_json":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N.json","view_paper":"https://pith.science/paper/DKN4XZME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1197&json=true","fetch_graph":"https://pith.science/api/pith-number/DKN4XZMEPR2ZODA2EVYWQ7DS6N/graph.json","fetch_events":"https://pith.science/api/pith-number/DKN4XZMEPR2ZODA2EVYWQ7DS6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N/action/storage_attestation","attest_author":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N/action/author_attestation","sign_citation":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N/action/citation_signature","submit_replication":"https://pith.science/pith/DKN4XZMEPR2ZODA2EVYWQ7DS6N/action/replication_record"}},"created_at":"2026-05-18T02:26:45.434606+00:00","updated_at":"2026-05-18T02:26:45.434606+00:00"}