{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KPE7RYNPVQFFTR2VIMB3MRT5ZF","short_pith_number":"pith:KPE7RYNP","schema_version":"1.0","canonical_sha256":"53c9f8e1afac0a59c7554303b6467dc94cd314b1862209f1bd7d0ef4e7d54b58","source":{"kind":"arxiv","id":"1708.05520","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.05520","created_at":"2026-05-18T00:37:49.834822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05520v1","created_at":"2026-05-18T00:37:49.834822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05520","created_at":"2026-05-18T00:37:49.834822+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPE7RYNPVQFF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPE7RYNPVQFFTR2V","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPE7RYNP","created_at":"2026-05-18T12:31:24.725408+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/KPE7RYNPVQFFTR2VIMB3MRT5ZF","json":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF.json","graph_json":"https://pith.science/api/pith-number/KPE7RYNPVQFFTR2VIMB3MRT5ZF/graph.json","events_json":"https://pith.science/api/pith-number/KPE7RYNPVQFFTR2VIMB3MRT5ZF/events.json","paper":"https://pith.science/paper/KPE7RYNP"},"agent_actions":{"view_html":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF","download_json":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF.json","view_paper":"https://pith.science/paper/KPE7RYNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05520&json=true","fetch_graph":"https://pith.science/api/pith-number/KPE7RYNPVQFFTR2VIMB3MRT5ZF/graph.json","fetch_events":"https://pith.science/api/pith-number/KPE7RYNPVQFFTR2VIMB3MRT5ZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/action/storage_attestation","attest_author":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/action/author_attestation","sign_citation":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/action/citation_signature","submit_replication":"https://pith.science/pith/KPE7RYNPVQFFTR2VIMB3MRT5ZF/action/replication_record"}},"created_at":"2026-05-18T00:37:49.834822+00:00","updated_at":"2026-05-18T00:37:49.834822+00:00"}