{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7C4D4UD6DX4HM6EQO4NY7U2DCF","short_pith_number":"pith:7C4D4UD6","schema_version":"1.0","canonical_sha256":"f8b83e507e1df8767890771b8fd3431175c61f545319e644d8c3f8cc1b1d06a1","source":{"kind":"arxiv","id":"0910.0281","version":2},"attestation_state":"computed","paper":{"title":"Hypergraphic LP Relaxations for Steiner Trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Pritchard, Deeparnab Chakrabarty, Jochen Koenemann","submitted_at":"2009-10-01T21:57:06Z","abstract_excerpt":"We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Koenemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the integrality gap of this LP, and studying its relation to other linear relaxations. Our results are the following. Structural results: We extend the technique of uncrossing, usually applied to families of sets, to families of partitions. As a consequence we show that any basic feasible solution to the partition LP formulation has sparse support. Although the number o"},"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":"0910.0281","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2009-10-01T21:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"220e9b04a2ecf9e57d6a2304098a3ac81e6d54c2e569003bb2edaf05674e506d","abstract_canon_sha256":"9bada096577e06d1930c8aa1e23692de3d35b2c2a2705a3062d6baf95a880f4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:35.122647Z","signature_b64":"rrjnEHrdCRLLEDs1BKdUcUQWrUo3dDKhZ3MwvgYv/pwdlsBmPfbYBRb3x7fN4M7Q3/o4Ni8x9vWfN5zsPth5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b83e507e1df8767890771b8fd3431175c61f545319e644d8c3f8cc1b1d06a1","last_reissued_at":"2026-05-18T02:11:35.122092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:35.122092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraphic LP Relaxations for Steiner Trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Pritchard, Deeparnab Chakrabarty, Jochen Koenemann","submitted_at":"2009-10-01T21:57:06Z","abstract_excerpt":"We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Koenemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the integrality gap of this LP, and studying its relation to other linear relaxations. Our results are the following. Structural results: We extend the technique of uncrossing, usually applied to families of sets, to families of partitions. As a consequence we show that any basic feasible solution to the partition LP formulation has sparse support. Although the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0281","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.0281","created_at":"2026-05-18T02:11:35.122180+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.0281v2","created_at":"2026-05-18T02:11:35.122180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0281","created_at":"2026-05-18T02:11:35.122180+00:00"},{"alias_kind":"pith_short_12","alias_value":"7C4D4UD6DX4H","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7C4D4UD6DX4HM6EQ","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7C4D4UD6","created_at":"2026-05-18T12:25:58.837520+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/7C4D4UD6DX4HM6EQO4NY7U2DCF","json":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF.json","graph_json":"https://pith.science/api/pith-number/7C4D4UD6DX4HM6EQO4NY7U2DCF/graph.json","events_json":"https://pith.science/api/pith-number/7C4D4UD6DX4HM6EQO4NY7U2DCF/events.json","paper":"https://pith.science/paper/7C4D4UD6"},"agent_actions":{"view_html":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF","download_json":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF.json","view_paper":"https://pith.science/paper/7C4D4UD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.0281&json=true","fetch_graph":"https://pith.science/api/pith-number/7C4D4UD6DX4HM6EQO4NY7U2DCF/graph.json","fetch_events":"https://pith.science/api/pith-number/7C4D4UD6DX4HM6EQO4NY7U2DCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF/action/storage_attestation","attest_author":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF/action/author_attestation","sign_citation":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF/action/citation_signature","submit_replication":"https://pith.science/pith/7C4D4UD6DX4HM6EQO4NY7U2DCF/action/replication_record"}},"created_at":"2026-05-18T02:11:35.122180+00:00","updated_at":"2026-05-18T02:11:35.122180+00:00"}