{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FJY2SJEPGKNLX2Q347445DWNMW","short_pith_number":"pith:FJY2SJEP","schema_version":"1.0","canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","source":{"kind":"arxiv","id":"1709.01124","version":1},"attestation_state":"computed","paper":{"title":"MIP Formulations for the Steiner Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Bernd Zey, Daniel Schmidt, Fran\\c{c}ois Margot","submitted_at":"2017-09-04T19:12:19Z","abstract_excerpt":"The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations. On the theoretical side, the best known bound can be obtained from an integer program [KLSv08]. It guarantees a value that is a (2-eps)-approximation of the integer optimum. On the practical side, bounds from a mixed integer program by Magnanti and Raghavan [MR05] are very close to the integer optimum in computational experiments, but the size of the model limits its practic"},"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":"1709.01124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-04T19:12:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"96e53228d4263f452c7b18266f524fb6c435d3a7f5a8c3f1b1b2e2442a9954a0","abstract_canon_sha256":"045ffed4a0aca5505f4a4fabef8d5e1a780e8fd6a4053bc6bb954970ac053a53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.854330Z","signature_b64":"RoCdxonUHwug7gZZXiZ/48v5RdYIMy6rF4gn9zmVbvs0loyYn2hB9q9XEY87RXbl2A7edeSHbx8fiAKPcb90Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","last_reissued_at":"2026-05-18T00:36:00.853929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.853929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MIP Formulations for the Steiner Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Bernd Zey, Daniel Schmidt, Fran\\c{c}ois Margot","submitted_at":"2017-09-04T19:12:19Z","abstract_excerpt":"The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations. On the theoretical side, the best known bound can be obtained from an integer program [KLSv08]. It guarantees a value that is a (2-eps)-approximation of the integer optimum. On the practical side, bounds from a mixed integer program by Magnanti and Raghavan [MR05] are very close to the integer optimum in computational experiments, but the size of the model limits its practic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01124","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":"1709.01124","created_at":"2026-05-18T00:36:00.853992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01124v1","created_at":"2026-05-18T00:36:00.853992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01124","created_at":"2026-05-18T00:36:00.853992+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJY2SJEPGKNL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJY2SJEPGKNLX2Q3","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJY2SJEP","created_at":"2026-05-18T12:31:15.632608+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/FJY2SJEPGKNLX2Q347445DWNMW","json":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW.json","graph_json":"https://pith.science/api/pith-number/FJY2SJEPGKNLX2Q347445DWNMW/graph.json","events_json":"https://pith.science/api/pith-number/FJY2SJEPGKNLX2Q347445DWNMW/events.json","paper":"https://pith.science/paper/FJY2SJEP"},"agent_actions":{"view_html":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW","download_json":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW.json","view_paper":"https://pith.science/paper/FJY2SJEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01124&json=true","fetch_graph":"https://pith.science/api/pith-number/FJY2SJEPGKNLX2Q347445DWNMW/graph.json","fetch_events":"https://pith.science/api/pith-number/FJY2SJEPGKNLX2Q347445DWNMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/action/storage_attestation","attest_author":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/action/author_attestation","sign_citation":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/action/citation_signature","submit_replication":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/action/replication_record"}},"created_at":"2026-05-18T00:36:00.853992+00:00","updated_at":"2026-05-18T00:36:00.853992+00:00"}