{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SJYNCQRP4ZD5P4TJ3FJQYKBTZC","short_pith_number":"pith:SJYNCQRP","canonical_record":{"source":{"id":"1511.03738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T00:56:35Z","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"title_canon_sha256":"28e675c42c700d8f79ec8df2c07b34a7883a428f7bc7cc83b22c2f6c257b04c6","abstract_canon_sha256":"95d30b433e303a2c04c66d645001d5baa543973c3b022d9d5c63e8f52d5c8ffb"},"schema_version":"1.0"},"canonical_sha256":"9270d1422fe647d7f269d9530c2833c88edb3ed02d8643fe7cf1e690248c2f8b","source":{"kind":"arxiv","id":"1511.03738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03738","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03738v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03738","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"SJYNCQRP4ZD5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SJYNCQRP4ZD5P4TJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SJYNCQRP","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SJYNCQRP4ZD5P4TJ3FJQYKBTZC","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T00:56:35Z","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"title_canon_sha256":"28e675c42c700d8f79ec8df2c07b34a7883a428f7bc7cc83b22c2f6c257b04c6","abstract_canon_sha256":"95d30b433e303a2c04c66d645001d5baa543973c3b022d9d5c63e8f52d5c8ffb"},"schema_version":"1.0"},"canonical_sha256":"9270d1422fe647d7f269d9530c2833c88edb3ed02d8643fe7cf1e690248c2f8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.230653Z","signature_b64":"6rmTUvCUmWqTuCmlp7L9M+NlnnmXxNeHTuHaGb3zDOrZOOOMd0FWhRqbcVT/+OrVqgBK3Kd5cQCBySLf/jVDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9270d1422fe647d7f269d9530c2833c88edb3ed02d8643fe7cf1e690248c2f8b","last_reissued_at":"2026-05-18T01:01:42.229919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.229919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03738","source_version":2,"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-05-18T01:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nhx47wyiiucwHTHd2DS1n22Iw70vcrYJcCdC1XHrcOAM1xobAzFyxqZxMncEJoqAmiEnmF9FBS09oSmdJZqWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:05:05.929293Z"},"content_sha256":"069d4a088ffd554c96975781d663253d5954d85d4336b2b1f037c91f0ab95bbf","schema_version":"1.0","event_id":"sha256:069d4a088ffd554c96975781d663253d5954d85d4336b2b1f037c91f0ab95bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SJYNCQRP4ZD5P4TJ3FJQYKBTZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree switching and partitioning for enumerating graphs to arbitrary orders of accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"David Burstein, Jonathan Rubin","submitted_at":"2015-11-12T00:56:35Z","abstract_excerpt":"We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence $d = a \\times b$ with maximum degree $d_{max}=O(S^{\\frac{1}{2}-\\tau})$ for an arbitrarily small positive number $\\tau$, where $S$ is the number edges specified by $d$. Our approach is based on two key steps, graph partitioning and degree preserving switches. The former idea allows us to relate enumeration results for given sequences to those for sequences that are especially easy to handle, while the latter facilitates expansions based on numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03738","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":""},"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-05-18T01:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36IGRtUPRmpA7SG5o2Dcm/XQa3K2ZLkMsQrDcl4klMOL8K3xdy5pxCB5H1dpdpq4LX5ZnAorCyk1j//gaPBUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:05:05.929655Z"},"content_sha256":"0a0dfe60418cccea6a67320bbcc2e0a920e5ac0866378261ad0daaffaefe694f","schema_version":"1.0","event_id":"sha256:0a0dfe60418cccea6a67320bbcc2e0a920e5ac0866378261ad0daaffaefe694f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/bundle.json","state_url":"https://pith.science/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/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-06-05T09:05:05Z","links":{"resolver":"https://pith.science/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC","bundle":"https://pith.science/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/bundle.json","state":"https://pith.science/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJYNCQRP4ZD5P4TJ3FJQYKBTZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SJYNCQRP4ZD5P4TJ3FJQYKBTZC","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":"95d30b433e303a2c04c66d645001d5baa543973c3b022d9d5c63e8f52d5c8ffb","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T00:56:35Z","title_canon_sha256":"28e675c42c700d8f79ec8df2c07b34a7883a428f7bc7cc83b22c2f6c257b04c6"},"schema_version":"1.0","source":{"id":"1511.03738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03738","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03738v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03738","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"SJYNCQRP4ZD5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SJYNCQRP4ZD5P4TJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SJYNCQRP","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:0a0dfe60418cccea6a67320bbcc2e0a920e5ac0866378261ad0daaffaefe694f","target":"graph","created_at":"2026-05-18T01:01:42Z","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"},"paper":{"abstract_excerpt":"We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence $d = a \\times b$ with maximum degree $d_{max}=O(S^{\\frac{1}{2}-\\tau})$ for an arbitrarily small positive number $\\tau$, where $S$ is the number edges specified by $d$. Our approach is based on two key steps, graph partitioning and degree preserving switches. The former idea allows us to relate enumeration results for given sequences to those for sequences that are especially easy to handle, while the latter facilitates expansions based on numbe","authors_text":"David Burstein, Jonathan Rubin","cross_cats":["cs.DM","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T00:56:35Z","title":"Degree switching and partitioning for enumerating graphs to arbitrary orders of accuracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03738","kind":"arxiv","version":2},"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:069d4a088ffd554c96975781d663253d5954d85d4336b2b1f037c91f0ab95bbf","target":"record","created_at":"2026-05-18T01:01:42Z","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":"95d30b433e303a2c04c66d645001d5baa543973c3b022d9d5c63e8f52d5c8ffb","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T00:56:35Z","title_canon_sha256":"28e675c42c700d8f79ec8df2c07b34a7883a428f7bc7cc83b22c2f6c257b04c6"},"schema_version":"1.0","source":{"id":"1511.03738","kind":"arxiv","version":2}},"canonical_sha256":"9270d1422fe647d7f269d9530c2833c88edb3ed02d8643fe7cf1e690248c2f8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9270d1422fe647d7f269d9530c2833c88edb3ed02d8643fe7cf1e690248c2f8b","first_computed_at":"2026-05-18T01:01:42.229919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:42.229919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rmTUvCUmWqTuCmlp7L9M+NlnnmXxNeHTuHaGb3zDOrZOOOMd0FWhRqbcVT/+OrVqgBK3Kd5cQCBySLf/jVDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:42.230653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:069d4a088ffd554c96975781d663253d5954d85d4336b2b1f037c91f0ab95bbf","sha256:0a0dfe60418cccea6a67320bbcc2e0a920e5ac0866378261ad0daaffaefe694f"],"state_sha256":"1387e2d78354482a6a5eedd6517c7790c5c75adfc7364b712643f7b313aa4e7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1jgiPNUpiuf4HBBBBkBq43BSUtnolHS1HhUfiA3tVU616JEqR3FJ6jPwSl6ZUaUER59snDx/Ewz1VmcbGn/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:05:05.931583Z","bundle_sha256":"5331ec2837f89e26ee3796cfd99323b080de619ba11dae4bf91e6b5602a146b6"}}