{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IT7HUTVDO74W77BWGXJ3UGW5HC","short_pith_number":"pith:IT7HUTVD","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"},"canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","source":{"kind":"arxiv","id":"1806.03426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03426","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03426v1","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03426","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"IT7HUTVDO74W","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IT7HUTVDO74W77BW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IT7HUTVD","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IT7HUTVDO74W77BWGXJ3UGW5HC","target":"record","payload":{"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"},"canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","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"},"source_kind":"arxiv","source_id":"1806.03426","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:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jm3OXVHOgIgGcOL+U/p+zUKst24qvtMsgpmz1I0sr2aCipy1eRpA3mkXWYlOITErMGd9MXvqBgy6X2TRTsoMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:50:36.272707Z"},"content_sha256":"360b4e76f8bfa43563edc881cd58315bf9edc39cad7de85af7b0817f4d14269a","schema_version":"1.0","event_id":"sha256:360b4e76f8bfa43563edc881cd58315bf9edc39cad7de85af7b0817f4d14269a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IT7HUTVDO74W77BWGXJ3UGW5HC","target":"graph","payload":{"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"},"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:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPVN0YGm4Mo0Ah7GaRNTP9RAmf3AiSTqHJKxm1NssXY2VJinBDUEpDlS/Rz104mknFXBOwacAF8skkar+7oHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:50:36.273405Z"},"content_sha256":"e3c9f567e0d409f0e1c3000c925afd258c43c30b996b548ad4c27b5067223b88","schema_version":"1.0","event_id":"sha256:e3c9f567e0d409f0e1c3000c925afd258c43c30b996b548ad4c27b5067223b88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/bundle.json","state_url":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/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:50:36Z","links":{"resolver":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC","bundle":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/bundle.json","state":"https://pith.science/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT7HUTVDO74W77BWGXJ3UGW5HC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IT7HUTVDO74W77BWGXJ3UGW5HC","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":"cf10ab9da926a4821322a00b001b45dc05baf2a5166f95a9260142a2f99caa41","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T07:15:32Z","title_canon_sha256":"a23734b4290d64b63766161c452d4ddff88aebb64205b1bd332261b11955b2fb"},"schema_version":"1.0","source":{"id":"1806.03426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03426","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03426v1","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03426","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"IT7HUTVDO74W","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IT7HUTVDO74W77BW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IT7HUTVD","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e3c9f567e0d409f0e1c3000c925afd258c43c30b996b548ad4c27b5067223b88","target":"graph","created_at":"2026-05-18T00:13:24Z","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":"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.","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Zolt\\'an Kir\\'aly","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T07:15:32Z","title":"Acyclic orientations with degree constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03426","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:360b4e76f8bfa43563edc881cd58315bf9edc39cad7de85af7b0817f4d14269a","target":"record","created_at":"2026-05-18T00:13:24Z","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":"cf10ab9da926a4821322a00b001b45dc05baf2a5166f95a9260142a2f99caa41","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T07:15:32Z","title_canon_sha256":"a23734b4290d64b63766161c452d4ddff88aebb64205b1bd332261b11955b2fb"},"schema_version":"1.0","source":{"id":"1806.03426","kind":"arxiv","version":1}},"canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44fe7a4ea377f96ffc3635d3ba1add38a2447be50053e02b3bb83f329fc68c54","first_computed_at":"2026-05-18T00:13:24.928144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:24.928144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wNk0ffHfyCiivbP9F5Eao9D0R0Nlpim8nZjfJiuVKdjALBNoFYXnNKWn0+QUjTZyq1QKKkJaYCHA79oXe4s2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:24.928898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:360b4e76f8bfa43563edc881cd58315bf9edc39cad7de85af7b0817f4d14269a","sha256:e3c9f567e0d409f0e1c3000c925afd258c43c30b996b548ad4c27b5067223b88"],"state_sha256":"85b1b8b62467564f97ae69e850018e87cb71d74b79f560349b63fa45dcd5ecff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jUgtmuX+JNzpM0PUS320giB4VDX4XJRf2nCt3v6nlqDm3VIxBRT6JgKl1NDpLl+cJztsNzQO4z91XkH7KipBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:50:36.277524Z","bundle_sha256":"6e39dc4ef9e929c664e82c8d2b7c699a1fc5929036c0f2b94f8e7ea070957dbc"}}