{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S3TFF5ZGBTGAQDKONDRJ2RV2YZ","short_pith_number":"pith:S3TFF5ZG","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"},"canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","source":{"kind":"arxiv","id":"1804.07496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07496","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07496v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07496","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"S3TFF5ZGBTGA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S3TFF5ZGBTGAQDKO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S3TFF5ZG","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S3TFF5ZGBTGAQDKONDRJ2RV2YZ","target":"record","payload":{"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"},"canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","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"},"source_kind":"arxiv","source_id":"1804.07496","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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"487g5JTTYK9wDHgOjQFy1HMRJQ4Ikwz+mnmVYHizrbEa/1+tYw3/tkzanLNU0xgf5/SP7lyLKhFYtfr3MnYAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:19.632437Z"},"content_sha256":"ce3abf0133927394d738c79f3924597d197730e3ff592dc76d59d4580d313a6a","schema_version":"1.0","event_id":"sha256:ce3abf0133927394d738c79f3924597d197730e3ff592dc76d59d4580d313a6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S3TFF5ZGBTGAQDKONDRJ2RV2YZ","target":"graph","payload":{"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"},"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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICNFlJ1ktxWu5YAXQzX/6zmxTJlK7I5U0YcOkSMPzdjPki27Az87h8zacYbH5pcfUS33x8EDrGsctoIM/YIZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:19.632844Z"},"content_sha256":"b040cbe8d5170196d4b9f3baa19c039dc0dba0dd219c56544f515f4325c7af3a","schema_version":"1.0","event_id":"sha256:b040cbe8d5170196d4b9f3baa19c039dc0dba0dd219c56544f515f4325c7af3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/bundle.json","state_url":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/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-27T22:15:19Z","links":{"resolver":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ","bundle":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/bundle.json","state":"https://pith.science/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3TFF5ZGBTGAQDKONDRJ2RV2YZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S3TFF5ZGBTGAQDKONDRJ2RV2YZ","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":"d7eb73edb9e7bb3aa9ae8a41816c4d3fb26a6e58ac0be8ab73405b150a8187fb","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-20T08:57:39Z","title_canon_sha256":"9e16ab408f9247274b577c902b4598684383f2606b4c1763afb1cf303f58c528"},"schema_version":"1.0","source":{"id":"1804.07496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07496","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07496v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07496","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"S3TFF5ZGBTGA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S3TFF5ZGBTGAQDKO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S3TFF5ZG","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b040cbe8d5170196d4b9f3baa19c039dc0dba0dd219c56544f515f4325c7af3a","target":"graph","created_at":"2026-05-18T00:17:58Z","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":"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","authors_text":"Andre L\\\"offler, Johannes Blum, Johannes Zink, Moritz Beck, Myroslav Kryven","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-20T08:57:39Z","title":"Planar Steiner Orientation is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07496","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:ce3abf0133927394d738c79f3924597d197730e3ff592dc76d59d4580d313a6a","target":"record","created_at":"2026-05-18T00:17:58Z","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":"d7eb73edb9e7bb3aa9ae8a41816c4d3fb26a6e58ac0be8ab73405b150a8187fb","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-20T08:57:39Z","title_canon_sha256":"9e16ab408f9247274b577c902b4598684383f2606b4c1763afb1cf303f58c528"},"schema_version":"1.0","source":{"id":"1804.07496","kind":"arxiv","version":1}},"canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96e652f7260ccc080d4e68e29d46bac649c31e2a13e9220d0bdb65252b1d14f8","first_computed_at":"2026-05-18T00:17:58.633941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:58.633941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nb951bCsu+chJ3SQZrHUEfopJdMFR/4WOUJSrQSIMJZuOx0NfsJ5N/Mp9TDwZr7x6dM3qRwAVC3/ZoOpGMRsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:58.634448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce3abf0133927394d738c79f3924597d197730e3ff592dc76d59d4580d313a6a","sha256:b040cbe8d5170196d4b9f3baa19c039dc0dba0dd219c56544f515f4325c7af3a"],"state_sha256":"d595bc4bda91b1774fea5211d37fb5d0de5ddaf80e6fa1e8383f0b430e847d40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubDYwbgquZp3XRciHft/Am/+mW68FFJUJbyn4EZ8Q1U/QaOE949OgX4ISLXjgtH0gMxpNv5KG+6wZRrHi1OGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:15:19.635237Z","bundle_sha256":"52583d3f613adfc1ab7ac4cabb9d667069d9eb986df6bede9149f25ce72bdc78"}}