{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IT7HUTVDO74W77BWGXJ3UGW5HC","short_pith_number":"pith:IT7HUTVD","schema_version":"1.0","canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","source":{"kind":"arxiv","id":"1806.03426","version":1},"attestation_state":"computed","paper":{"title":"Acyclic orientations with degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Zolt\\'an Kir\\'aly","submitted_at":"2018-06-09T07:15:32Z","abstract_excerpt":"In this note we study the complexity of some generalizations of the notion of $st$-numbering.\n  Suppose that given some functions $f$ and $g$, we want to order the vertices of a graph such that every vertex $v$ is preceded by at least $f(v)$ of its neighbors and succeeded by at least $g(v)$ of its neighbors.\n  We prove that this problem is solvable in polynomial time if $fg\\equiv 0$, but it becomes NP-complete for $f\\equiv g \\equiv 2$.\n  This answers a question of the first author posed in 2009."},"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":"1806.03426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T07:15:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a23734b4290d64b63766161c452d4ddff88aebb64205b1bd332261b11955b2fb","abstract_canon_sha256":"cf10ab9da926a4821322a00b001b45dc05baf2a5166f95a9260142a2f99caa41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:24.928898Z","signature_b64":"wNk0ffHfyCiivbP9F5Eao9D0R0Nlpim8nZjfJiuVKdjALBNoFYXnNKWn0+QUjTZyq1QKKkJaYCHA79oXe4s2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","last_reissued_at":"2026-05-18T00:13:24.928144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:24.928144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclic orientations with degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Zolt\\'an Kir\\'aly","submitted_at":"2018-06-09T07:15:32Z","abstract_excerpt":"In this note we study the complexity of some generalizations of the notion of $st$-numbering.\n  Suppose that given some functions $f$ and $g$, we want to order the vertices of a graph such that every vertex $v$ is preceded by at least $f(v)$ of its neighbors and succeeded by at least $g(v)$ of its neighbors.\n  We prove that this problem is solvable in polynomial time if $fg\\equiv 0$, but it becomes NP-complete for $f\\equiv g \\equiv 2$.\n  This answers a question of the first author posed in 2009."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03426","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":"1806.03426","created_at":"2026-05-18T00:13:24.928253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03426v1","created_at":"2026-05-18T00:13:24.928253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03426","created_at":"2026-05-18T00:13:24.928253+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT7HUTVDO74W","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT7HUTVDO74W77BW","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT7HUTVD","created_at":"2026-05-18T12:32:31.084164+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/IT7HUTVDO74W77BWGXJ3UGW5HC","json":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC.json","graph_json":"https://pith.science/api/pith-number/IT7HUTVDO74W77BWGXJ3UGW5HC/graph.json","events_json":"https://pith.science/api/pith-number/IT7HUTVDO74W77BWGXJ3UGW5HC/events.json","paper":"https://pith.science/paper/IT7HUTVD"},"agent_actions":{"view_html":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC","download_json":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC.json","view_paper":"https://pith.science/paper/IT7HUTVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03426&json=true","fetch_graph":"https://pith.science/api/pith-number/IT7HUTVDO74W77BWGXJ3UGW5HC/graph.json","fetch_events":"https://pith.science/api/pith-number/IT7HUTVDO74W77BWGXJ3UGW5HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/action/storage_attestation","attest_author":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/action/author_attestation","sign_citation":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/action/citation_signature","submit_replication":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/action/replication_record"}},"created_at":"2026-05-18T00:13:24.928253+00:00","updated_at":"2026-05-18T00:13:24.928253+00:00"}