{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FXHR5NL2RBIPWS5OU6YWU7Y3KO","short_pith_number":"pith:FXHR5NL2","canonical_record":{"source":{"id":"1112.2273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T12:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"8e9104b10e7170f00451eb0b33e7267ce0c0dced9cb6f876bcf66259a865f7d1","abstract_canon_sha256":"8ca880e1b90dfb1f854af401cd4e9ad5166346c3c78034b207f7eb653f211b75"},"schema_version":"1.0"},"canonical_sha256":"2dcf1eb57a8850fb4baea7b16a7f1b53b07098a8c70526f32f8596c1c4faa93b","source":{"kind":"arxiv","id":"1112.2273","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2273","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2273v2","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2273","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"FXHR5NL2RBIP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXHR5NL2RBIPWS5O","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXHR5NL2","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FXHR5NL2RBIPWS5OU6YWU7Y3KO","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T12:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"8e9104b10e7170f00451eb0b33e7267ce0c0dced9cb6f876bcf66259a865f7d1","abstract_canon_sha256":"8ca880e1b90dfb1f854af401cd4e9ad5166346c3c78034b207f7eb653f211b75"},"schema_version":"1.0"},"canonical_sha256":"2dcf1eb57a8850fb4baea7b16a7f1b53b07098a8c70526f32f8596c1c4faa93b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:48.585411Z","signature_b64":"2d9KdpcXvS3I+aSHRH5zHcjP33TSBxT8J9TyjSbfwDqoF989j54Jlai1qnNGIHQp3Xuefsp3MEwKqsvtGosXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dcf1eb57a8850fb4baea7b16a7f1b53b07098a8c70526f32f8596c1c4faa93b","last_reissued_at":"2026-05-18T03:50:48.584828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:48.584828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2273","source_version":2,"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-18T03:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8gqylUqW/R1zEW2DF6TXjuRmS9BeUz6SehzSRxatncE7eBFYG/s/kUZoHdAQEmNeTBMPBYeCjjVpy37E8CKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:02:20.075205Z"},"content_sha256":"6d4c17bb5be5042e40b4c5bc2e28aff97d3836d1b9fde52319065ae2df0cdb02","schema_version":"1.0","event_id":"sha256:6d4c17bb5be5042e40b4c5bc2e28aff97d3836d1b9fde52319065ae2df0cdb02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FXHR5NL2RBIPWS5OU6YWU7Y3KO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steiner Forest Orientation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Marek Cygan, Zeev Nutov","submitted_at":"2011-12-10T12:24:13Z","abstract_excerpt":"We consider connectivity problems with orientation constraints. Given a directed graph $D$ and a collection of ordered node pairs $P$ let $P[D]=\\{(u,v) \\in P: D {contains a} uv{-path}}$. In the {\\sf Steiner Forest Orientation} problem we are given an undirected graph $G=(V,E)$ with edge-costs and a set $P \\subseteq V \\times V$ of ordered node pairs. The goal is to find a minimum-cost subgraph $H$ of $G$ and an orientation $D$ of $H$ such that $P[D]=P$. We give a 4-approximation algorithm for this problem.\n  In the {\\sf Maximum Pairs Orientation} problem we are given a graph $G$ and a multi-col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2273","kind":"arxiv","version":2},"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-18T03:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwS4IAbBJ+Jjyj/lR7CNWw/H8bBMgqkbKGHSEOrHRdGgztlsbgukaXjTnYq6lsVCBkCvWYSdv2aOVkcu76N2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:02:20.075780Z"},"content_sha256":"49cd5dcb6f92b920c534df4f9fc3311696de618040a98cd9abe08b306e39248b","schema_version":"1.0","event_id":"sha256:49cd5dcb6f92b920c534df4f9fc3311696de618040a98cd9abe08b306e39248b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/bundle.json","state_url":"https://pith.science/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/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-18T22:02:20Z","links":{"resolver":"https://pith.science/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO","bundle":"https://pith.science/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/bundle.json","state":"https://pith.science/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXHR5NL2RBIPWS5OU6YWU7Y3KO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FXHR5NL2RBIPWS5OU6YWU7Y3KO","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":"8ca880e1b90dfb1f854af401cd4e9ad5166346c3c78034b207f7eb653f211b75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T12:24:13Z","title_canon_sha256":"8e9104b10e7170f00451eb0b33e7267ce0c0dced9cb6f876bcf66259a865f7d1"},"schema_version":"1.0","source":{"id":"1112.2273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2273","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2273v2","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2273","created_at":"2026-05-18T03:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"FXHR5NL2RBIP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXHR5NL2RBIPWS5O","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXHR5NL2","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:49cd5dcb6f92b920c534df4f9fc3311696de618040a98cd9abe08b306e39248b","target":"graph","created_at":"2026-05-18T03:50:48Z","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":"We consider connectivity problems with orientation constraints. Given a directed graph $D$ and a collection of ordered node pairs $P$ let $P[D]=\\{(u,v) \\in P: D {contains a} uv{-path}}$. In the {\\sf Steiner Forest Orientation} problem we are given an undirected graph $G=(V,E)$ with edge-costs and a set $P \\subseteq V \\times V$ of ordered node pairs. The goal is to find a minimum-cost subgraph $H$ of $G$ and an orientation $D$ of $H$ such that $P[D]=P$. We give a 4-approximation algorithm for this problem.\n  In the {\\sf Maximum Pairs Orientation} problem we are given a graph $G$ and a multi-col","authors_text":"Guy Kortsarz, Marek Cygan, Zeev Nutov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T12:24:13Z","title":"Steiner Forest Orientation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2273","kind":"arxiv","version":2},"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:6d4c17bb5be5042e40b4c5bc2e28aff97d3836d1b9fde52319065ae2df0cdb02","target":"record","created_at":"2026-05-18T03:50:48Z","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":"8ca880e1b90dfb1f854af401cd4e9ad5166346c3c78034b207f7eb653f211b75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T12:24:13Z","title_canon_sha256":"8e9104b10e7170f00451eb0b33e7267ce0c0dced9cb6f876bcf66259a865f7d1"},"schema_version":"1.0","source":{"id":"1112.2273","kind":"arxiv","version":2}},"canonical_sha256":"2dcf1eb57a8850fb4baea7b16a7f1b53b07098a8c70526f32f8596c1c4faa93b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dcf1eb57a8850fb4baea7b16a7f1b53b07098a8c70526f32f8596c1c4faa93b","first_computed_at":"2026-05-18T03:50:48.584828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:48.584828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2d9KdpcXvS3I+aSHRH5zHcjP33TSBxT8J9TyjSbfwDqoF989j54Jlai1qnNGIHQp3Xuefsp3MEwKqsvtGosXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:48.585411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d4c17bb5be5042e40b4c5bc2e28aff97d3836d1b9fde52319065ae2df0cdb02","sha256:49cd5dcb6f92b920c534df4f9fc3311696de618040a98cd9abe08b306e39248b"],"state_sha256":"252e1d39255b81c590a8b0b639ce00d9bd1bde7e83d50158093ddd6e612bff68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tuP923bxPRs7A9LeR0MTvXy+DdK5kVYqQ4wP/Dcwn05E4J6PMPl6IHpuVXG/tnAFXDCsyv1hxKTYVHi0+KkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:02:20.077612Z","bundle_sha256":"bc71db056be2f4da932b0654f1e1392cc5b48dcdb6fdd1af17f0050ef54a551f"}}