{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:37XJTIYK4VID6QRJQPTLLEOHJB","short_pith_number":"pith:37XJTIYK","canonical_record":{"source":{"id":"1607.07082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T19:20:05Z","cross_cats_sorted":[],"title_canon_sha256":"93a18205fb50ff49fe7f592f7e800b13e8504245942d1f06cef6de2e663213b8","abstract_canon_sha256":"14fd351c570d55fdf3ecea5137a83f5425e2a4741f931b1f70921dfe02a4d712"},"schema_version":"1.0"},"canonical_sha256":"dfee99a30ae5503f422983e6b591c74845676b2dbc31a5ed6db64f8eb9fd7e9c","source":{"kind":"arxiv","id":"1607.07082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07082","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07082v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07082","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"37XJTIYK4VID","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37XJTIYK4VID6QRJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37XJTIYK","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:37XJTIYK4VID6QRJQPTLLEOHJB","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T19:20:05Z","cross_cats_sorted":[],"title_canon_sha256":"93a18205fb50ff49fe7f592f7e800b13e8504245942d1f06cef6de2e663213b8","abstract_canon_sha256":"14fd351c570d55fdf3ecea5137a83f5425e2a4741f931b1f70921dfe02a4d712"},"schema_version":"1.0"},"canonical_sha256":"dfee99a30ae5503f422983e6b591c74845676b2dbc31a5ed6db64f8eb9fd7e9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:34.850582Z","signature_b64":"4MaT+KMc2UQ7v34NNeDnf0LnPFCrO7+lgNCWXQnivJGPWCn6tcapRaNSuN4ZpDmUUIYjBAvfufEXbB9Bj5kJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfee99a30ae5503f422983e6b591c74845676b2dbc31a5ed6db64f8eb9fd7e9c","last_reissued_at":"2026-05-18T01:10:34.850012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:34.850012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07082","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1F5+h//SoEoTAtJlUzQLIZXla7ZhbSmTKH5zE8T20TiBa+aT6vA97NrNsX16HqqnHCaR/ANdJxyEdDhsk/YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:11:03.428163Z"},"content_sha256":"20a6da1010efcd4bd50d9032ea59f987713b5e4008249a9ef6a55512d9755187","schema_version":"1.0","event_id":"sha256:20a6da1010efcd4bd50d9032ea59f987713b5e4008249a9ef6a55512d9755187"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:37XJTIYK4VID6QRJQPTLLEOHJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the edge capacitated Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"(2) ENSTA/UMA/CEDRIC, (3) Polytechnique Montreal/GERAD, Alain Hertz (3) ((1) CNAM/CEDRIC, Canada), Cedric Bentz (1), France, Marie-Christine Costa (2), Paris, Saclay","submitted_at":"2016-07-24T19:20:05Z","abstract_excerpt":"Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total length, rooted at r, spanning a given subset T of vertices, and such that, for each e in E, there are at most c(e) paths, linking r to vertices in T, that contain e. We study the complexity and approximability of the problem, considering several relevant parameters such as the number of terminals, the edge lengths and the minimum and maximum edge capacities. For all but on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07082","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3ggjSHfgzkUQTdrsSHNKmk0NNVvpNRzvVwUzDlR/xGGBOBKKsl8+KJu2EXHqU31O1t5ByvPV9br7cFOUPuYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:11:03.428525Z"},"content_sha256":"e3e55238456df1ca2b4a74d8933a013cb85153fedb98bf4a1447e838e966edf6","schema_version":"1.0","event_id":"sha256:e3e55238456df1ca2b4a74d8933a013cb85153fedb98bf4a1447e838e966edf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37XJTIYK4VID6QRJQPTLLEOHJB/bundle.json","state_url":"https://pith.science/pith/37XJTIYK4VID6QRJQPTLLEOHJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37XJTIYK4VID6QRJQPTLLEOHJB/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-04T21:11:03Z","links":{"resolver":"https://pith.science/pith/37XJTIYK4VID6QRJQPTLLEOHJB","bundle":"https://pith.science/pith/37XJTIYK4VID6QRJQPTLLEOHJB/bundle.json","state":"https://pith.science/pith/37XJTIYK4VID6QRJQPTLLEOHJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37XJTIYK4VID6QRJQPTLLEOHJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:37XJTIYK4VID6QRJQPTLLEOHJB","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":"14fd351c570d55fdf3ecea5137a83f5425e2a4741f931b1f70921dfe02a4d712","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T19:20:05Z","title_canon_sha256":"93a18205fb50ff49fe7f592f7e800b13e8504245942d1f06cef6de2e663213b8"},"schema_version":"1.0","source":{"id":"1607.07082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07082","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07082v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07082","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"37XJTIYK4VID","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37XJTIYK4VID6QRJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37XJTIYK","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:e3e55238456df1ca2b4a74d8933a013cb85153fedb98bf4a1447e838e966edf6","target":"graph","created_at":"2026-05-18T01:10:34Z","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":"Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total length, rooted at r, spanning a given subset T of vertices, and such that, for each e in E, there are at most c(e) paths, linking r to vertices in T, that contain e. We study the complexity and approximability of the problem, considering several relevant parameters such as the number of terminals, the edge lengths and the minimum and maximum edge capacities. For all but on","authors_text":"(2) ENSTA/UMA/CEDRIC, (3) Polytechnique Montreal/GERAD, Alain Hertz (3) ((1) CNAM/CEDRIC, Canada), Cedric Bentz (1), France, Marie-Christine Costa (2), Paris, Saclay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T19:20:05Z","title":"On the edge capacitated Steiner tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07082","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:20a6da1010efcd4bd50d9032ea59f987713b5e4008249a9ef6a55512d9755187","target":"record","created_at":"2026-05-18T01:10:34Z","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":"14fd351c570d55fdf3ecea5137a83f5425e2a4741f931b1f70921dfe02a4d712","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T19:20:05Z","title_canon_sha256":"93a18205fb50ff49fe7f592f7e800b13e8504245942d1f06cef6de2e663213b8"},"schema_version":"1.0","source":{"id":"1607.07082","kind":"arxiv","version":1}},"canonical_sha256":"dfee99a30ae5503f422983e6b591c74845676b2dbc31a5ed6db64f8eb9fd7e9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfee99a30ae5503f422983e6b591c74845676b2dbc31a5ed6db64f8eb9fd7e9c","first_computed_at":"2026-05-18T01:10:34.850012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:34.850012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4MaT+KMc2UQ7v34NNeDnf0LnPFCrO7+lgNCWXQnivJGPWCn6tcapRaNSuN4ZpDmUUIYjBAvfufEXbB9Bj5kJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:34.850582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20a6da1010efcd4bd50d9032ea59f987713b5e4008249a9ef6a55512d9755187","sha256:e3e55238456df1ca2b4a74d8933a013cb85153fedb98bf4a1447e838e966edf6"],"state_sha256":"c0ae22588d0860e9babfd0dabdf60937ef7668578c4f2b94881c98d29c2fa485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMaxfK8cr1FvBAhxV0Bdcz/UX6gITe/BZsSwnMReoR0Hiwf8ERrkRzV0N4IBvpT5Kk0pjYUvEUZej1qRz9i2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:11:03.430541Z","bundle_sha256":"6cb349e8bacff15023b5d71bcc3656e2b20d625076ab47ba7f36a3656d4a137d"}}