{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S3TFF5ZGBTGAQDKONDRJ2RV2YZ","short_pith_number":"pith:S3TFF5ZG","schema_version":"1.0","canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","source":{"kind":"arxiv","id":"1804.07496","version":1},"attestation_state":"computed","paper":{"title":"Planar Steiner Orientation is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Andre L\\\"offler, Johannes Blum, Johannes Zink, Moritz Beck, Myroslav Kryven","submitted_at":"2018-04-20T08:57:39Z","abstract_excerpt":"Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an orientation of the undirected edges in G such that there is a directed path for every terminal pair in T ? This problem was shown to be NP -complete by Arkin and Hassin [1] and later W [1]-hard by Pilipczuk and Wahlstr\\\"om [7], parametrized by k. On the other hand, there is an XP algorithm by Cygan et al. [3] and a polynomial time algorithm for graphs without direc"},"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":"1804.07496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-20T08:57:39Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"9e16ab408f9247274b577c902b4598684383f2606b4c1763afb1cf303f58c528","abstract_canon_sha256":"d7eb73edb9e7bb3aa9ae8a41816c4d3fb26a6e58ac0be8ab73405b150a8187fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:58.634448Z","signature_b64":"Nb951bCsu+chJ3SQZrHUEfopJdMFR/4WOUJSrQSIMJZuOx0NfsJ5N/Mp9TDwZr7x6dM3qRwAVC3/ZoOpGMRsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","last_reissued_at":"2026-05-18T00:17:58.633941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:58.633941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Steiner Orientation is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Andre L\\\"offler, Johannes Blum, Johannes Zink, Moritz Beck, Myroslav Kryven","submitted_at":"2018-04-20T08:57:39Z","abstract_excerpt":"Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an orientation of the undirected edges in G such that there is a directed path for every terminal pair in T ? This problem was shown to be NP -complete by Arkin and Hassin [1] and later W [1]-hard by Pilipczuk and Wahlstr\\\"om [7], parametrized by k. On the other hand, there is an XP algorithm by Cygan et al. [3] and a polynomial time algorithm for graphs without direc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07496","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":"1804.07496","created_at":"2026-05-18T00:17:58.634024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07496v1","created_at":"2026-05-18T00:17:58.634024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07496","created_at":"2026-05-18T00:17:58.634024+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3TFF5ZGBTGA","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3TFF5ZGBTGAQDKO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3TFF5ZG","created_at":"2026-05-18T12:32:50.500415+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/S3TFF5ZGBTGAQDKONDRJ2RV2YZ","json":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ.json","graph_json":"https://pith.science/api/pith-number/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/graph.json","events_json":"https://pith.science/api/pith-number/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/events.json","paper":"https://pith.science/paper/S3TFF5ZG"},"agent_actions":{"view_html":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ","download_json":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ.json","view_paper":"https://pith.science/paper/S3TFF5ZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07496&json=true","fetch_graph":"https://pith.science/api/pith-number/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/graph.json","fetch_events":"https://pith.science/api/pith-number/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/action/storage_attestation","attest_author":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/action/author_attestation","sign_citation":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/action/citation_signature","submit_replication":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/action/replication_record"}},"created_at":"2026-05-18T00:17:58.634024+00:00","updated_at":"2026-05-18T00:17:58.634024+00:00"}