{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XHR3XGHIKOU6HJ65RYZGJFVXW3","short_pith_number":"pith:XHR3XGHI","schema_version":"1.0","canonical_sha256":"b9e3bb98e853a9e3a7dd8e326496b7b6f0a9d16d01e667c056c46edba49f8956","source":{"kind":"arxiv","id":"1110.1510","version":2},"attestation_state":"computed","paper":{"title":"NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Sepp Hartung","submitted_at":"2011-10-07T12:52:19Z","abstract_excerpt":"In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the graph is directed or undirected. In contrary, we show NP-completeness for the problem of realizing a given sequence of pairs of positive integers (representing indegrees and outdegrees) with a directed acyclic graph, answering an open question of Berger and M\\\"uller-Hannemann [FCT 2011]. Furthermore, we classify the problem as fixed-parameter tractable with resp"},"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":"1110.1510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-07T12:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"2dd15892fd5afe88a2e4ed638d37a08cc8d44db59d476c496758d27ed44861e9","abstract_canon_sha256":"d040f9c424c85abee1ecc3472b1b39128b16c161bc8368fde62cd261938023e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:29.774213Z","signature_b64":"Er6sQR7d9CG0s+K6F4yCGqs0mC9/fLUoUIWv4hSiRHgb+PpoLv/T8E0OqaX1EBbcKfQoGhNqXjXYoTQDN+MFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9e3bb98e853a9e3a7dd8e326496b7b6f0a9d16d01e667c056c46edba49f8956","last_reissued_at":"2026-05-18T04:04:29.773486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:29.773486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Sepp Hartung","submitted_at":"2011-10-07T12:52:19Z","abstract_excerpt":"In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the graph is directed or undirected. In contrary, we show NP-completeness for the problem of realizing a given sequence of pairs of positive integers (representing indegrees and outdegrees) with a directed acyclic graph, answering an open question of Berger and M\\\"uller-Hannemann [FCT 2011]. Furthermore, we classify the problem as fixed-parameter tractable with resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1510","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.1510","created_at":"2026-05-18T04:04:29.773614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1510v2","created_at":"2026-05-18T04:04:29.773614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1510","created_at":"2026-05-18T04:04:29.773614+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHR3XGHIKOU6","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHR3XGHIKOU6HJ65","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHR3XGHI","created_at":"2026-05-18T12:26:44.992195+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/XHR3XGHIKOU6HJ65RYZGJFVXW3","json":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3.json","graph_json":"https://pith.science/api/pith-number/XHR3XGHIKOU6HJ65RYZGJFVXW3/graph.json","events_json":"https://pith.science/api/pith-number/XHR3XGHIKOU6HJ65RYZGJFVXW3/events.json","paper":"https://pith.science/paper/XHR3XGHI"},"agent_actions":{"view_html":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3","download_json":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3.json","view_paper":"https://pith.science/paper/XHR3XGHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1510&json=true","fetch_graph":"https://pith.science/api/pith-number/XHR3XGHIKOU6HJ65RYZGJFVXW3/graph.json","fetch_events":"https://pith.science/api/pith-number/XHR3XGHIKOU6HJ65RYZGJFVXW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3/action/storage_attestation","attest_author":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3/action/author_attestation","sign_citation":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3/action/citation_signature","submit_replication":"https://pith.science/pith/XHR3XGHIKOU6HJ65RYZGJFVXW3/action/replication_record"}},"created_at":"2026-05-18T04:04:29.773614+00:00","updated_at":"2026-05-18T04:04:29.773614+00:00"}