{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JBVY5PJ4RUVZAT7WO5UAVENCT5","short_pith_number":"pith:JBVY5PJ4","canonical_record":{"source":{"id":"2103.15958","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2021-03-29T21:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"487094b80113068ba697f84f73873570df62167a487dbe0b6c7aa796af24768e","abstract_canon_sha256":"098939d5497d3c027b14f81bd46a7b26784a01217529cc7489c1a6a692f4d7f0"},"schema_version":"1.0"},"canonical_sha256":"486b8ebd3c8d2b904ff677680a91a29f489113a9d60e31aa3be7f44d28048508","source":{"kind":"arxiv","id":"2103.15958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15958","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15958v3","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15958","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBVY5PJ4RUVZ","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_16","alias_value":"JBVY5PJ4RUVZAT7W","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_8","alias_value":"JBVY5PJ4","created_at":"2026-07-05T04:34:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JBVY5PJ4RUVZAT7WO5UAVENCT5","target":"record","payload":{"canonical_record":{"source":{"id":"2103.15958","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2021-03-29T21:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"487094b80113068ba697f84f73873570df62167a487dbe0b6c7aa796af24768e","abstract_canon_sha256":"098939d5497d3c027b14f81bd46a7b26784a01217529cc7489c1a6a692f4d7f0"},"schema_version":"1.0"},"canonical_sha256":"486b8ebd3c8d2b904ff677680a91a29f489113a9d60e31aa3be7f44d28048508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:45.323287Z","signature_b64":"dTw/gJaoJRbJCMroNXWV4k+5shWJ/BqJVYWYVyvl+VcTJJZZ+B+NVTTzb2dM2cBVo9IABpXLB7s7GtvCrsl4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486b8ebd3c8d2b904ff677680a91a29f489113a9d60e31aa3be7f44d28048508","last_reissued_at":"2026-07-05T04:34:45.322867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:45.322867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.15958","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZDuJZQGR5vmU5cZf8bMEjPTyAq/AkjQ4YQXmMPX4EyaINjpv9cu6LUaYBMVSl4uq9Ootn32YNpPhm2I9XyzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:18:48.122838Z"},"content_sha256":"92dfbdf57d79d71d0da1ddde7ac4de4be820879dadb96c56e7460cf312f645bf","schema_version":"1.0","event_id":"sha256:92dfbdf57d79d71d0da1ddde7ac4de4be820879dadb96c56e7460cf312f645bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JBVY5PJ4RUVZAT7WO5UAVENCT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential stub matching for uniform generation of directed graphs with a given degree sequence","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Femke van Ieperen, Ivan Kryven","submitted_at":"2021-03-29T21:17:02Z","abstract_excerpt":"Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to achieve almost linear expected complexity for this problem. Here we discuss the sequential stub matching for directed graphs and show that this process can be mould to sample simple digraphs with asymptotically equal probability. The process starts with an empty edge set and repeatedly adds edges to it with a certain state-dependent bias until the desired degree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15958","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.15958/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5I6cw+7k+KMqFHLpYtFNLLCvLPCPbPLe7ibc2nTKAOHOShsH23jG/F93VAwtNAzaU2/jnaey+ANMr57AIpMrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:18:48.123436Z"},"content_sha256":"0d9183be691380c8532de868b75c8721e0699c726327edb496005191655a130a","schema_version":"1.0","event_id":"sha256:0d9183be691380c8532de868b75c8721e0699c726327edb496005191655a130a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/bundle.json","state_url":"https://pith.science/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T20:18:48Z","links":{"resolver":"https://pith.science/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5","bundle":"https://pith.science/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/bundle.json","state":"https://pith.science/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBVY5PJ4RUVZAT7WO5UAVENCT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JBVY5PJ4RUVZAT7WO5UAVENCT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"098939d5497d3c027b14f81bd46a7b26784a01217529cc7489c1a6a692f4d7f0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2021-03-29T21:17:02Z","title_canon_sha256":"487094b80113068ba697f84f73873570df62167a487dbe0b6c7aa796af24768e"},"schema_version":"1.0","source":{"id":"2103.15958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15958","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15958v3","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15958","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBVY5PJ4RUVZ","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_16","alias_value":"JBVY5PJ4RUVZAT7W","created_at":"2026-07-05T04:34:45Z"},{"alias_kind":"pith_short_8","alias_value":"JBVY5PJ4","created_at":"2026-07-05T04:34:45Z"}],"graph_snapshots":[{"event_id":"sha256:0d9183be691380c8532de868b75c8721e0699c726327edb496005191655a130a","target":"graph","created_at":"2026-07-05T04:34:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.15958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to achieve almost linear expected complexity for this problem. Here we discuss the sequential stub matching for directed graphs and show that this process can be mould to sample simple digraphs with asymptotically equal probability. The process starts with an empty edge set and repeatedly adds edges to it with a certain state-dependent bias until the desired degree","authors_text":"Femke van Ieperen, Ivan Kryven","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2021-03-29T21:17:02Z","title":"Sequential stub matching for uniform generation of directed graphs with a given degree sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15958","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92dfbdf57d79d71d0da1ddde7ac4de4be820879dadb96c56e7460cf312f645bf","target":"record","created_at":"2026-07-05T04:34:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"098939d5497d3c027b14f81bd46a7b26784a01217529cc7489c1a6a692f4d7f0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2021-03-29T21:17:02Z","title_canon_sha256":"487094b80113068ba697f84f73873570df62167a487dbe0b6c7aa796af24768e"},"schema_version":"1.0","source":{"id":"2103.15958","kind":"arxiv","version":3}},"canonical_sha256":"486b8ebd3c8d2b904ff677680a91a29f489113a9d60e31aa3be7f44d28048508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"486b8ebd3c8d2b904ff677680a91a29f489113a9d60e31aa3be7f44d28048508","first_computed_at":"2026-07-05T04:34:45.322867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:45.322867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dTw/gJaoJRbJCMroNXWV4k+5shWJ/BqJVYWYVyvl+VcTJJZZ+B+NVTTzb2dM2cBVo9IABpXLB7s7GtvCrsl4BA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:45.323287Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92dfbdf57d79d71d0da1ddde7ac4de4be820879dadb96c56e7460cf312f645bf","sha256:0d9183be691380c8532de868b75c8721e0699c726327edb496005191655a130a"],"state_sha256":"13ca34c5aa917acbc2953acaa46c2fae3c3b0e9be60e2cc0d42ea5e065f9fb68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAx9ikc4Gwodupg/MgtNFl+ZNghwZAuRg8r5xMJeB+WtODXEmr5XtNET3IsunGyflzGhdtyf2eLdHc/4x88QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T20:18:48.127710Z","bundle_sha256":"f3086a33d68c7d6e568b7d25ea2991c566a30910b0722e50d8537b5138f16228"}}