{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FJY2SJEPGKNLX2Q347445DWNMW","short_pith_number":"pith:FJY2SJEP","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"},"canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","source":{"kind":"arxiv","id":"1709.01124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01124","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01124v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01124","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"FJY2SJEPGKNL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJY2SJEPGKNLX2Q3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJY2SJEP","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FJY2SJEPGKNLX2Q347445DWNMW","target":"record","payload":{"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"},"canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","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"},"source_kind":"arxiv","source_id":"1709.01124","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"niwi07B8ndcpPy2Gh9a7uMEUZEdHRhuluNwqxi+OR1zUm5OTT0TVG2d8sQ5UvJMnHij6vBl/vHRk3ufXPBYODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:03:48.437269Z"},"content_sha256":"65afd188217e213df7fe908baa7c5e8cca435054b48a770b54fcc15e6965113a","schema_version":"1.0","event_id":"sha256:65afd188217e213df7fe908baa7c5e8cca435054b48a770b54fcc15e6965113a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FJY2SJEPGKNLX2Q347445DWNMW","target":"graph","payload":{"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"},"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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFVMJyXl/Xr1Yt2VS4btKAXeKLWSSQ+RWoIl3rRU+1hUzgZZ46lHLGQ9NgeEYR0G+AMAlqKYLMqMYbCNQL4jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:03:48.437642Z"},"content_sha256":"039eda7d96d1ee753d72a8e5e3c52ec01c67174b2f282f8c194d5e1bea58795b","schema_version":"1.0","event_id":"sha256:039eda7d96d1ee753d72a8e5e3c52ec01c67174b2f282f8c194d5e1bea58795b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/bundle.json","state_url":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJY2SJEPGKNLX2Q347445DWNMW/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-30T21:03:48Z","links":{"resolver":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW","bundle":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/bundle.json","state":"https://pith.science/pith/FJY2SJEPGKNLX2Q347445DWNMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJY2SJEPGKNLX2Q347445DWNMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FJY2SJEPGKNLX2Q347445DWNMW","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":"045ffed4a0aca5505f4a4fabef8d5e1a780e8fd6a4053bc6bb954970ac053a53","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-04T19:12:19Z","title_canon_sha256":"96e53228d4263f452c7b18266f524fb6c435d3a7f5a8c3f1b1b2e2442a9954a0"},"schema_version":"1.0","source":{"id":"1709.01124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01124","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01124v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01124","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"FJY2SJEPGKNL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJY2SJEPGKNLX2Q3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJY2SJEP","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:039eda7d96d1ee753d72a8e5e3c52ec01c67174b2f282f8c194d5e1bea58795b","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"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","authors_text":"Bernd Zey, Daniel Schmidt, Fran\\c{c}ois Margot","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-04T19:12:19Z","title":"MIP Formulations for the Steiner Forest Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01124","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:65afd188217e213df7fe908baa7c5e8cca435054b48a770b54fcc15e6965113a","target":"record","created_at":"2026-05-18T00:36:00Z","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":"045ffed4a0aca5505f4a4fabef8d5e1a780e8fd6a4053bc6bb954970ac053a53","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-04T19:12:19Z","title_canon_sha256":"96e53228d4263f452c7b18266f524fb6c435d3a7f5a8c3f1b1b2e2442a9954a0"},"schema_version":"1.0","source":{"id":"1709.01124","kind":"arxiv","version":1}},"canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a71a9248f329abbea1be7f9ce8ecd658004d85110760e17d71781545b7e2d73","first_computed_at":"2026-05-18T00:36:00.853929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.853929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RoCdxonUHwug7gZZXiZ/48v5RdYIMy6rF4gn9zmVbvs0loyYn2hB9q9XEY87RXbl2A7edeSHbx8fiAKPcb90Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.854330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65afd188217e213df7fe908baa7c5e8cca435054b48a770b54fcc15e6965113a","sha256:039eda7d96d1ee753d72a8e5e3c52ec01c67174b2f282f8c194d5e1bea58795b"],"state_sha256":"bf978a71d0462d29592421b2cf481e91d8bf95050c4ea9b1dd51e10df674dd01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbOXfdu/W84jENNGlGttVklgt+HaqlPXq9g7Qv0i6cddS6BoXtKDb95kbVFPWQZtJ0OvBpnAho8qwmmcUSAYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:03:48.442455Z","bundle_sha256":"3ccb2084622ffafaf1cc3fcc474260f2aecab934bbf546896f9e5edc88a15a15"}}