{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KPE7RYNPVQFFTR2VIMB3MRT5ZF","short_pith_number":"pith:KPE7RYNP","canonical_record":{"source":{"id":"1708.05520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-18T06:58:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5a59194e23d916f00a806fc3ac4a82d96e569c7f9b88d96e7f4f00ae67861611","abstract_canon_sha256":"6dc2193bb58c07c1a6fb3a3fd1191ce4b630f6e8cf81289f2902e040594d2cc3"},"schema_version":"1.0"},"canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","source":{"kind":"arxiv","id":"1708.05520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05520","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05520v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05520","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"KPE7RYNPVQFF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPE7RYNPVQFFTR2V","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPE7RYNP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KPE7RYNPVQFFTR2VIMB3MRT5ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-18T06:58:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5a59194e23d916f00a806fc3ac4a82d96e569c7f9b88d96e7f4f00ae67861611","abstract_canon_sha256":"6dc2193bb58c07c1a6fb3a3fd1191ce4b630f6e8cf81289f2902e040594d2cc3"},"schema_version":"1.0"},"canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:49.835403Z","signature_b64":"T8GiqE2D9SnHaiU6jORb2vRXtmH9avH/f2v9YRfilFHauW6IjwEmDV+AYJ49B5Ur0WTYZcNNWL8dwg76GIF3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","last_reissued_at":"2026-05-18T00:37:49.834732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:49.834732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05520","source_version":1,"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-18T00:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmDP29Dp7iAM2BJdfmo24d2RuxJrFq9+WPYLhvbiO0iHD2TYsZDvlM/CBzBDOEZceC9hInVoXPdib4M9WIdMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:16:07.187766Z"},"content_sha256":"3d09c1d0dce16befff821a531db2393f0ea294d1bcc400d8bb6afb899cee33ad","schema_version":"1.0","event_id":"sha256:3d09c1d0dce16befff821a531db2393f0ea294d1bcc400d8bb6afb899cee33ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KPE7RYNPVQFFTR2VIMB3MRT5ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Steffen Rechner","submitted_at":"2017-08-18T06:58:37Z","abstract_excerpt":"We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from large running times. In this paper, we present a realization algorithm that constructs an appropriate bipartite graph G=(U,V,E) in O(|U| + |V| + |E|) time, which is asymptotically optimal. In addition, we show that our algorithm produces edge-minimal bipartite graphs and that it can easily be modified to construct edge-maximal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05520","kind":"arxiv","version":1},"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-18T00:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vC0qAsP4V0klq8A5h1hN6eePEaA/hDt1dOa2mFUdJfCgcweCLo42FNo2NGUcdoxIKj3RrV9EUA/XYKhS6MOJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:16:07.188447Z"},"content_sha256":"b3d45158820d7e2f4e1de03862e123d885b60bbbb817532b70bb1c6b36e69a08","schema_version":"1.0","event_id":"sha256:b3d45158820d7e2f4e1de03862e123d885b60bbbb817532b70bb1c6b36e69a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/bundle.json","state_url":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/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-31T17:16:07Z","links":{"resolver":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF","bundle":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/bundle.json","state":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KPE7RYNPVQFFTR2VIMB3MRT5ZF","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":"6dc2193bb58c07c1a6fb3a3fd1191ce4b630f6e8cf81289f2902e040594d2cc3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-18T06:58:37Z","title_canon_sha256":"5a59194e23d916f00a806fc3ac4a82d96e569c7f9b88d96e7f4f00ae67861611"},"schema_version":"1.0","source":{"id":"1708.05520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05520","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05520v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05520","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"KPE7RYNPVQFF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPE7RYNPVQFFTR2V","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPE7RYNP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b3d45158820d7e2f4e1de03862e123d885b60bbbb817532b70bb1c6b36e69a08","target":"graph","created_at":"2026-05-18T00:37:49Z","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 consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from large running times. In this paper, we present a realization algorithm that constructs an appropriate bipartite graph G=(U,V,E) in O(|U| + |V| + |E|) time, which is asymptotically optimal. In addition, we show that our algorithm produces edge-minimal bipartite graphs and that it can easily be modified to construct edge-maximal graphs.","authors_text":"Steffen Rechner","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-18T06:58:37Z","title":"An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05520","kind":"arxiv","version":1},"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:3d09c1d0dce16befff821a531db2393f0ea294d1bcc400d8bb6afb899cee33ad","target":"record","created_at":"2026-05-18T00:37:49Z","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":"6dc2193bb58c07c1a6fb3a3fd1191ce4b630f6e8cf81289f2902e040594d2cc3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-18T06:58:37Z","title_canon_sha256":"5a59194e23d916f00a806fc3ac4a82d96e569c7f9b88d96e7f4f00ae67861611"},"schema_version":"1.0","source":{"id":"1708.05520","kind":"arxiv","version":1}},"canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","first_computed_at":"2026-05-18T00:37:49.834732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:49.834732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8GiqE2D9SnHaiU6jORb2vRXtmH9avH/f2v9YRfilFHauW6IjwEmDV+AYJ49B5Ur0WTYZcNNWL8dwg76GIF3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:49.835403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d09c1d0dce16befff821a531db2393f0ea294d1bcc400d8bb6afb899cee33ad","sha256:b3d45158820d7e2f4e1de03862e123d885b60bbbb817532b70bb1c6b36e69a08"],"state_sha256":"f80424a8dc88bc1e9eb00f3723fe36e513906b240bb8f34a890b843998a0e6b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fsWtAbeEubOB/b/7cKl6WOkeHJHLE5Dhb/DSSxi5Eu5SsD8YeEW3/TwGOJLgfMb4bg4iVoJnjafPdoisuzKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:16:07.192352Z","bundle_sha256":"0241eff30a63bda0b60b173917735a016248087b0d105c30ea773a3c7f0e517c"}}