{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SH765III2WOMEPKQGKZCPZJNGY","short_pith_number":"pith:SH765III","canonical_record":{"source":{"id":"1511.02411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-07T23:47:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"42c958bc5c7296d46322bd157bfee3debf3d462febaed2c0b1bdebe099fd972d","abstract_canon_sha256":"57f7cc3de1688ad084d09b82732bcc25a3a01bdef2106c5f2101a7d6513792a6"},"schema_version":"1.0"},"canonical_sha256":"91ffeea108d59cc23d5032b227e52d360b42197dcf84a79ccaa089dbb187499d","source":{"kind":"arxiv","id":"1511.02411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02411","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02411v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02411","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"SH765III2WOM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SH765III2WOMEPKQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SH765III","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SH765III2WOMEPKQGKZCPZJNGY","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-07T23:47:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"42c958bc5c7296d46322bd157bfee3debf3d462febaed2c0b1bdebe099fd972d","abstract_canon_sha256":"57f7cc3de1688ad084d09b82732bcc25a3a01bdef2106c5f2101a7d6513792a6"},"schema_version":"1.0"},"canonical_sha256":"91ffeea108d59cc23d5032b227e52d360b42197dcf84a79ccaa089dbb187499d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.238325Z","signature_b64":"P4wGgTUQXCEhXr8aHkkCEG2z+DKNW5E7l58+Ug3tOvJAQE7z6JrN7yfZ5nrGqj7tzyOL0OIfi97YckSQK1JwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ffeea108d59cc23d5032b227e52d360b42197dcf84a79ccaa089dbb187499d","last_reissued_at":"2026-05-18T01:01:42.237835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.237835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02411","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":"YUTvYgVlVIBWo1QqrI2TEajWBfBLRDflepIM5zTzCa/s0X4PUeE4TyuID8jnphOGJUxauEN+eHLjm82WCbigCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:38.926535Z"},"content_sha256":"efb1f8ed2b92078a0ec66775a6e2e49b7f54ed4647e5c906acf4967bb3a62b22","schema_version":"1.0","event_id":"sha256:efb1f8ed2b92078a0ec66775a6e2e49b7f54ed4647e5c906acf4967bb3a62b22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SH765III2WOMEPKQGKZCPZJNGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sufficient Conditions for Graphicality of Bidegree Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David Burstein, Jonathan Rubin","submitted_at":"2015-11-07T23:47:30Z","abstract_excerpt":"There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality criteria that depend on the number of elements in the sequence, corresponding to the number of nodes in an associated graph, and the mean degree of the sequence. These conditions, which are stated in terms of bidegree sequences for directed graphs, are easier to apply than classic necessary and sufficient graphicality conditions involving multiple inequalities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02411","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":"bu3q1ltG+uOw8cmW88Q1gGWJq63FqQfcjXMInGJCoZ2zt/5neQQHgDwYBXGThJWQTTF9X2IBU3CZQI2gMiBOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:38.927268Z"},"content_sha256":"332d70e4a70a263d1567e7468e9ec3f98f418654c7c4f48126541882b6486f60","schema_version":"1.0","event_id":"sha256:332d70e4a70a263d1567e7468e9ec3f98f418654c7c4f48126541882b6486f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH765III2WOMEPKQGKZCPZJNGY/bundle.json","state_url":"https://pith.science/pith/SH765III2WOMEPKQGKZCPZJNGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH765III2WOMEPKQGKZCPZJNGY/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-05-27T11:53:38Z","links":{"resolver":"https://pith.science/pith/SH765III2WOMEPKQGKZCPZJNGY","bundle":"https://pith.science/pith/SH765III2WOMEPKQGKZCPZJNGY/bundle.json","state":"https://pith.science/pith/SH765III2WOMEPKQGKZCPZJNGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH765III2WOMEPKQGKZCPZJNGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SH765III2WOMEPKQGKZCPZJNGY","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":"57f7cc3de1688ad084d09b82732bcc25a3a01bdef2106c5f2101a7d6513792a6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-07T23:47:30Z","title_canon_sha256":"42c958bc5c7296d46322bd157bfee3debf3d462febaed2c0b1bdebe099fd972d"},"schema_version":"1.0","source":{"id":"1511.02411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02411","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02411v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02411","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"SH765III2WOM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SH765III2WOMEPKQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SH765III","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:332d70e4a70a263d1567e7468e9ec3f98f418654c7c4f48126541882b6486f60","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":"There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality criteria that depend on the number of elements in the sequence, corresponding to the number of nodes in an associated graph, and the mean degree of the sequence. These conditions, which are stated in terms of bidegree sequences for directed graphs, are easier to apply than classic necessary and sufficient graphicality conditions involving multiple inequalities","authors_text":"David Burstein, Jonathan Rubin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-07T23:47:30Z","title":"Sufficient Conditions for Graphicality of Bidegree Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02411","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:efb1f8ed2b92078a0ec66775a6e2e49b7f54ed4647e5c906acf4967bb3a62b22","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":"57f7cc3de1688ad084d09b82732bcc25a3a01bdef2106c5f2101a7d6513792a6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-07T23:47:30Z","title_canon_sha256":"42c958bc5c7296d46322bd157bfee3debf3d462febaed2c0b1bdebe099fd972d"},"schema_version":"1.0","source":{"id":"1511.02411","kind":"arxiv","version":2}},"canonical_sha256":"91ffeea108d59cc23d5032b227e52d360b42197dcf84a79ccaa089dbb187499d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91ffeea108d59cc23d5032b227e52d360b42197dcf84a79ccaa089dbb187499d","first_computed_at":"2026-05-18T01:01:42.237835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:42.237835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4wGgTUQXCEhXr8aHkkCEG2z+DKNW5E7l58+Ug3tOvJAQE7z6JrN7yfZ5nrGqj7tzyOL0OIfi97YckSQK1JwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:42.238325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efb1f8ed2b92078a0ec66775a6e2e49b7f54ed4647e5c906acf4967bb3a62b22","sha256:332d70e4a70a263d1567e7468e9ec3f98f418654c7c4f48126541882b6486f60"],"state_sha256":"2c50dfe5e2683e2bdb8df6b6b078168504201f3b8c4999089e4a5742003051fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqXY8ZC+SOa+uy7TQTsG97MB2Yzu0jjmCIEGo9+aeGcEffS2eJ3f8xGZKeyK2cGchAi6OqvN+nQsgClnQAZhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:53:38.931353Z","bundle_sha256":"1a922ae0f54df08a49e12b5fe18d902b9548d8499d2959d67c9823601e992a81"}}