{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LPRKIBMNQ54BFXGTB2UHNE5M2W","short_pith_number":"pith:LPRKIBMN","schema_version":"1.0","canonical_sha256":"5be2a4058d877812dcd30ea87693acd5aec7c9d380487c0d68a0bc8dc485c73a","source":{"kind":"arxiv","id":"1706.08015","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08015","created_at":"2026-05-18T00:41:43.879962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08015v1","created_at":"2026-05-18T00:41:43.879962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08015","created_at":"2026-05-18T00:41:43.879962+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPRKIBMNQ54B","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPRKIBMNQ54BFXGT","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPRKIBMN","created_at":"2026-05-18T12:31:28.150371+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/LPRKIBMNQ54BFXGTB2UHNE5M2W","json":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W.json","graph_json":"https://pith.science/api/pith-number/LPRKIBMNQ54BFXGTB2UHNE5M2W/graph.json","events_json":"https://pith.science/api/pith-number/LPRKIBMNQ54BFXGTB2UHNE5M2W/events.json","paper":"https://pith.science/paper/LPRKIBMN"},"agent_actions":{"view_html":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W","download_json":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W.json","view_paper":"https://pith.science/paper/LPRKIBMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08015&json=true","fetch_graph":"https://pith.science/api/pith-number/LPRKIBMNQ54BFXGTB2UHNE5M2W/graph.json","fetch_events":"https://pith.science/api/pith-number/LPRKIBMNQ54BFXGTB2UHNE5M2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/action/storage_attestation","attest_author":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/action/author_attestation","sign_citation":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/action/citation_signature","submit_replication":"https://pith.science/pith/LPRKIBMNQ54BFXGTB2UHNE5M2W/action/replication_record"}},"created_at":"2026-05-18T00:41:43.879962+00:00","updated_at":"2026-05-18T00:41:43.879962+00:00"}