{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LPRKIBMNQ54BFXGTB2UHNE5M2W","short_pith_number":"pith:LPRKIBMN","canonical_record":{"source":{"id":"1706.08015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-25T00:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"23812759b5e745d596f1f171c43db1eaa8f188bc57aea46adeb7ec5793275929","abstract_canon_sha256":"b0e89aa1a3af0e9cec7d007e8e3c1fcaeb072a129478c613e986589fa731bf3a"},"schema_version":"1.0"},"canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","source":{"kind":"arxiv","id":"1706.08015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08015","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08015v1","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08015","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPRKIBMNQ54B","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LPRKIBMNQ54BFXGT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LPRKIBMN","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LPRKIBMNQ54BFXGTB2UHNE5M2W","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-25T00:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"23812759b5e745d596f1f171c43db1eaa8f188bc57aea46adeb7ec5793275929","abstract_canon_sha256":"b0e89aa1a3af0e9cec7d007e8e3c1fcaeb072a129478c613e986589fa731bf3a"},"schema_version":"1.0"},"canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:43.880545Z","signature_b64":"It7QZ60W5HCHLDfJ5gwXD+OBMFW8Ht63f8p2eFgoJpdB2EySSxCKdePopxVzNqGVafSO/lp8gQoI2WQWjOHXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","last_reissued_at":"2026-05-18T00:41:43.879870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:43.879870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08015","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:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLJcq1eSPVHkF9q9k8JzJfc/826o+ixSqkk3FgjNNeXIegdSdPLwn+1YQzy+2Rztvsn12moHiI1v81rWxC/3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:45.317085Z"},"content_sha256":"0bc45cdf0c947f01f763c73403d8c2034fe15028d494d91694f3c2a9a7cbf107","schema_version":"1.0","event_id":"sha256:0bc45cdf0c947f01f763c73403d8c2034fe15028d494d91694f3c2a9a7cbf107"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LPRKIBMNQ54BFXGTB2UHNE5M2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On integer network synthesis problem with tree-metric cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hiroshi Hirai, Masashi Nitta","submitted_at":"2017-06-25T00:08:48Z","abstract_excerpt":"Network synthesis problem (NSP) is the problem of designing a minimum-cost network (from the empty network) satisfying a given connectivity requirement. Hau, Hirai, and Tsuchimura showed that if the edge-cost is a tree metric, then a simple greedy-type algorithm solves NSP to obtain a half-integral optimal solution. This is a generalization of the classical result by Gomory and Hu for the uniform edge-cost. In this note, we present an integer version of Hau, Hirai, and Tsuchimura's result for integer network synthesis problem (INSP), where a required network must have an integer capacity. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08015","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:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLdUhEKDu+0lvuEFa94a8yRdIxWVhSij+X/9X7qO4QNva3abKQdwShV3BrJZ8gLYRFtjqa1Is+elmWVlLtKwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:45.317460Z"},"content_sha256":"5ae9f83c46d4a8b0bfef5fb47c7c26cf5a189a8db8c9069421ec7e23026aeadb","schema_version":"1.0","event_id":"sha256:5ae9f83c46d4a8b0bfef5fb47c7c26cf5a189a8db8c9069421ec7e23026aeadb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/bundle.json","state_url":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/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-05-27T02:11:45Z","links":{"resolver":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W","bundle":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/bundle.json","state":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LPRKIBMNQ54BFXGTB2UHNE5M2W","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":"b0e89aa1a3af0e9cec7d007e8e3c1fcaeb072a129478c613e986589fa731bf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-25T00:08:48Z","title_canon_sha256":"23812759b5e745d596f1f171c43db1eaa8f188bc57aea46adeb7ec5793275929"},"schema_version":"1.0","source":{"id":"1706.08015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08015","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08015v1","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08015","created_at":"2026-05-18T00:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPRKIBMNQ54B","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LPRKIBMNQ54BFXGT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LPRKIBMN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5ae9f83c46d4a8b0bfef5fb47c7c26cf5a189a8db8c9069421ec7e23026aeadb","target":"graph","created_at":"2026-05-18T00:41:43Z","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":"Network synthesis problem (NSP) is the problem of designing a minimum-cost network (from the empty network) satisfying a given connectivity requirement. Hau, Hirai, and Tsuchimura showed that if the edge-cost is a tree metric, then a simple greedy-type algorithm solves NSP to obtain a half-integral optimal solution. This is a generalization of the classical result by Gomory and Hu for the uniform edge-cost. In this note, we present an integer version of Hau, Hirai, and Tsuchimura's result for integer network synthesis problem (INSP), where a required network must have an integer capacity. We p","authors_text":"Hiroshi Hirai, Masashi Nitta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-25T00:08:48Z","title":"On integer network synthesis problem with tree-metric cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08015","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:0bc45cdf0c947f01f763c73403d8c2034fe15028d494d91694f3c2a9a7cbf107","target":"record","created_at":"2026-05-18T00:41:43Z","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":"b0e89aa1a3af0e9cec7d007e8e3c1fcaeb072a129478c613e986589fa731bf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-25T00:08:48Z","title_canon_sha256":"23812759b5e745d596f1f171c43db1eaa8f188bc57aea46adeb7ec5793275929"},"schema_version":"1.0","source":{"id":"1706.08015","kind":"arxiv","version":1}},"canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","first_computed_at":"2026-05-18T00:41:43.879870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:43.879870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"It7QZ60W5HCHLDfJ5gwXD+OBMFW8Ht63f8p2eFgoJpdB2EySSxCKdePopxVzNqGVafSO/lp8gQoI2WQWjOHXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:43.880545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bc45cdf0c947f01f763c73403d8c2034fe15028d494d91694f3c2a9a7cbf107","sha256:5ae9f83c46d4a8b0bfef5fb47c7c26cf5a189a8db8c9069421ec7e23026aeadb"],"state_sha256":"056c8ea1c7d5a06903037c25f5c493d03b08cb945a411b5296f646aab5fdbdf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggUJPHEhNrZichvDceK02uPa85rYyqgvCrkfIbHLlmmbmSra0oYg75MltCa84EwtUJwXBcLeEkOSoQlt22I3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:11:45.319713Z","bundle_sha256":"7fbbb9c7a7b6b6505f8671d0b88f50bd9ecf6483837aba95c0eda32c0c4cf52d"}}