{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:462TJK6XYTHTWG7R22FBTIRECN","short_pith_number":"pith:462TJK6X","schema_version":"1.0","canonical_sha256":"e7b534abd7c4cf3b1bf1d68a19a224135fa15e32222a3d9963c9bd92ce9fa09c","source":{"kind":"arxiv","id":"1509.01301","version":1},"attestation_state":"computed","paper":{"title":"Completing orientations of partially oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"J. Huang, Joergen Bang-Jensen, Xuding Zhu","submitted_at":"2015-09-03T22:58:14Z","abstract_excerpt":"We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in C by orienting the (non-oriented) edges in P. Orien- tation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, incl"},"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":"1509.01301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-03T22:58:14Z","cross_cats_sorted":[],"title_canon_sha256":"732f5e1a5c6e681f07b670c8a5138cb6a58e01a2346f27fbd6dee21cc07dd2db","abstract_canon_sha256":"9a978d49bcab7076703420d56ec80d1a3f1b9cc6ee1849a116898abbb632e449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:58.037747Z","signature_b64":"9GfFtijzylaegqtZj4Rq6RqyHS3gxIshlcQaKJUszRGKfBmfTx8C98LaER1zoqBip/gNq0viEFua1D9cdNuvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b534abd7c4cf3b1bf1d68a19a224135fa15e32222a3d9963c9bd92ce9fa09c","last_reissued_at":"2026-05-18T01:33:58.037123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:58.037123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completing orientations of partially oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"J. Huang, Joergen Bang-Jensen, Xuding Zhu","submitted_at":"2015-09-03T22:58:14Z","abstract_excerpt":"We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in C by orienting the (non-oriented) edges in P. Orien- tation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, incl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01301","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":"1509.01301","created_at":"2026-05-18T01:33:58.037199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01301v1","created_at":"2026-05-18T01:33:58.037199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01301","created_at":"2026-05-18T01:33:58.037199+00:00"},{"alias_kind":"pith_short_12","alias_value":"462TJK6XYTHT","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"462TJK6XYTHTWG7R","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"462TJK6X","created_at":"2026-05-18T12:29:05.191682+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/462TJK6XYTHTWG7R22FBTIRECN","json":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN.json","graph_json":"https://pith.science/api/pith-number/462TJK6XYTHTWG7R22FBTIRECN/graph.json","events_json":"https://pith.science/api/pith-number/462TJK6XYTHTWG7R22FBTIRECN/events.json","paper":"https://pith.science/paper/462TJK6X"},"agent_actions":{"view_html":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN","download_json":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN.json","view_paper":"https://pith.science/paper/462TJK6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01301&json=true","fetch_graph":"https://pith.science/api/pith-number/462TJK6XYTHTWG7R22FBTIRECN/graph.json","fetch_events":"https://pith.science/api/pith-number/462TJK6XYTHTWG7R22FBTIRECN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN/action/storage_attestation","attest_author":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN/action/author_attestation","sign_citation":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN/action/citation_signature","submit_replication":"https://pith.science/pith/462TJK6XYTHTWG7R22FBTIRECN/action/replication_record"}},"created_at":"2026-05-18T01:33:58.037199+00:00","updated_at":"2026-05-18T01:33:58.037199+00:00"}