{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5BQY6Z6PMKFHXL4Q3WTEYTE5VM","short_pith_number":"pith:5BQY6Z6P","canonical_record":{"source":{"id":"1202.5049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-22T21:19:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"58389cd49e7ec92f4c6d5b30b880fd0904371d14c335bc5d6ab4849cea02b454","abstract_canon_sha256":"dabcdb2963483f882130de2b7ea6de4886c7b7435ad0fad0e34d8967388b0629"},"schema_version":"1.0"},"canonical_sha256":"e8618f67cf628a7baf90dda64c4c9dab3109d9dcccd81b865c05acc1cb4b2ce3","source":{"kind":"arxiv","id":"1202.5049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5049","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5049v1","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5049","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"5BQY6Z6PMKFH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5BQY6Z6PMKFHXL4Q","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5BQY6Z6P","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5BQY6Z6PMKFHXL4Q3WTEYTE5VM","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-22T21:19:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"58389cd49e7ec92f4c6d5b30b880fd0904371d14c335bc5d6ab4849cea02b454","abstract_canon_sha256":"dabcdb2963483f882130de2b7ea6de4886c7b7435ad0fad0e34d8967388b0629"},"schema_version":"1.0"},"canonical_sha256":"e8618f67cf628a7baf90dda64c4c9dab3109d9dcccd81b865c05acc1cb4b2ce3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:39.083944Z","signature_b64":"gL+yNC7Rx/lsRm8pKNI3uP6NbN/16QHlWp9HNWpSRNLu6FFYNLxYw7pFL5ZRLrfhGy47ztnPXVpMQbrODMhxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8618f67cf628a7baf90dda64c4c9dab3109d9dcccd81b865c05acc1cb4b2ce3","last_reissued_at":"2026-05-18T04:01:39.083215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:39.083215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5049","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-18T04:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8eh2CIo5oXP57ojqXWOdS9G1GGHvadOWLbdDVmnRsrjwSKzftG4YL/cAr/it5erlnqSBP1OCJVHsGWYOOLy1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:59:57.200966Z"},"content_sha256":"269d11c8ba6b011906e8b089ce45c96ff10d29469fea72dfb543c04d90d26625","schema_version":"1.0","event_id":"sha256:269d11c8ba6b011906e8b089ce45c96ff10d29469fea72dfb543c04d90d26625"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5BQY6Z6PMKFHXL4Q3WTEYTE5VM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Isaac Fung, Jochen Koenemann, Konstantinos Georgiou, Malcolm Sharpe","submitted_at":"2012-02-22T21:19:30Z","abstract_excerpt":"We consider the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorithm to exactly solve the so called directed component relaxation (DCR), a specific form of hypergraphic LP relaxation that was instrumental in the recent break-through result by Byrka et al. [BGRS10] (STOC 2010). Our algorithm hinges on an efficiently computable map from extreme points of the bidirected cut relaxation to feasible solutions of (DCR). As a consequence, together with [BGRS10] we immediately obtain an eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5049","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-18T04:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYqudkwQcCIwmpsvD5Yg8MJPtyB7qzXmu+dCr2/F064/tG0Jn1CYyioasol1wADA+cgC1wiKnl/a7M6NpXAtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:59:57.201715Z"},"content_sha256":"19b00e87ccf57a9780d76feb1cc2976049ed5cb30a56e499981f25a4b5aa90f7","schema_version":"1.0","event_id":"sha256:19b00e87ccf57a9780d76feb1cc2976049ed5cb30a56e499981f25a4b5aa90f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/bundle.json","state_url":"https://pith.science/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/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-06-07T15:59:57Z","links":{"resolver":"https://pith.science/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM","bundle":"https://pith.science/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/bundle.json","state":"https://pith.science/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BQY6Z6PMKFHXL4Q3WTEYTE5VM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5BQY6Z6PMKFHXL4Q3WTEYTE5VM","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":"dabcdb2963483f882130de2b7ea6de4886c7b7435ad0fad0e34d8967388b0629","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-22T21:19:30Z","title_canon_sha256":"58389cd49e7ec92f4c6d5b30b880fd0904371d14c335bc5d6ab4849cea02b454"},"schema_version":"1.0","source":{"id":"1202.5049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5049","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5049v1","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5049","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"5BQY6Z6PMKFH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5BQY6Z6PMKFHXL4Q","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5BQY6Z6P","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:19b00e87ccf57a9780d76feb1cc2976049ed5cb30a56e499981f25a4b5aa90f7","target":"graph","created_at":"2026-05-18T04:01:39Z","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 the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorithm to exactly solve the so called directed component relaxation (DCR), a specific form of hypergraphic LP relaxation that was instrumental in the recent break-through result by Byrka et al. [BGRS10] (STOC 2010). Our algorithm hinges on an efficiently computable map from extreme points of the bidirected cut relaxation to feasible solutions of (DCR). As a consequence, together with [BGRS10] we immediately obtain an eff","authors_text":"Isaac Fung, Jochen Koenemann, Konstantinos Georgiou, Malcolm Sharpe","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-22T21:19:30Z","title":"Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5049","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:269d11c8ba6b011906e8b089ce45c96ff10d29469fea72dfb543c04d90d26625","target":"record","created_at":"2026-05-18T04:01:39Z","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":"dabcdb2963483f882130de2b7ea6de4886c7b7435ad0fad0e34d8967388b0629","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-22T21:19:30Z","title_canon_sha256":"58389cd49e7ec92f4c6d5b30b880fd0904371d14c335bc5d6ab4849cea02b454"},"schema_version":"1.0","source":{"id":"1202.5049","kind":"arxiv","version":1}},"canonical_sha256":"e8618f67cf628a7baf90dda64c4c9dab3109d9dcccd81b865c05acc1cb4b2ce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8618f67cf628a7baf90dda64c4c9dab3109d9dcccd81b865c05acc1cb4b2ce3","first_computed_at":"2026-05-18T04:01:39.083215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:39.083215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gL+yNC7Rx/lsRm8pKNI3uP6NbN/16QHlWp9HNWpSRNLu6FFYNLxYw7pFL5ZRLrfhGy47ztnPXVpMQbrODMhxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:39.083944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:269d11c8ba6b011906e8b089ce45c96ff10d29469fea72dfb543c04d90d26625","sha256:19b00e87ccf57a9780d76feb1cc2976049ed5cb30a56e499981f25a4b5aa90f7"],"state_sha256":"552f63f59f355887f6e471e986aca231c5bd034cc040db76dd36c1ea58cd34af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKIPdG0zzapwbRxXl0Wx0NCO75ZUz48A8WLft3ujtFLB5ahppEV4lkB4AimlOwu7oGT73qBJ62Tp820+/62QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:59:57.206132Z","bundle_sha256":"1764d1e7b2dd5c25edde4b2d1644290175d774e99d6c02777efc6ccf9fe66012"}}