{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QLKSTBIELYQOI2SWIIWWTFLQKH","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":"d4d6f6de9238641be1cbed3da382661817ee57c82b94ac16df3e891a61875531","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-19T13:51:08Z","title_canon_sha256":"35046a7bce70881a04640e95cea786c33288584df9cedefb15c2e6589140ce42"},"schema_version":"1.0","source":{"id":"2104.09312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.09312","created_at":"2026-07-05T02:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"2104.09312v1","created_at":"2026-07-05T02:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.09312","created_at":"2026-07-05T02:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"QLKSTBIELYQO","created_at":"2026-07-05T02:33:11Z"},{"alias_kind":"pith_short_16","alias_value":"QLKSTBIELYQOI2SW","created_at":"2026-07-05T02:33:11Z"},{"alias_kind":"pith_short_8","alias_value":"QLKSTBIE","created_at":"2026-07-05T02:33:11Z"}],"graph_snapshots":[{"event_id":"sha256:840c18e439ccd3497768408d73d1141a91a9169870dbbfb0e74e5a835ac93fe6","target":"graph","created_at":"2026-07-05T02:33:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.09312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a fixed overall construction speed. The problem is strongly NP-hard even on stars. We present polynomial algorithms for the problem on trees with a fixed number of leaves, and on general networks with a fixed number of relevant pairs.","authors_text":"Igor Averbakh","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-19T13:51:08Z","title":"Minimizing the total weighted pairwise connection time in network construction problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.09312","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:29e833e28c6b6c3116764952b81495786b577f93153953909ec85c60fb56af81","target":"record","created_at":"2026-07-05T02:33:11Z","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":"d4d6f6de9238641be1cbed3da382661817ee57c82b94ac16df3e891a61875531","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-19T13:51:08Z","title_canon_sha256":"35046a7bce70881a04640e95cea786c33288584df9cedefb15c2e6589140ce42"},"schema_version":"1.0","source":{"id":"2104.09312","kind":"arxiv","version":1}},"canonical_sha256":"82d52985045e20e46a56422d69957051eb19f82a03ecd7dce15199cc9256c35a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82d52985045e20e46a56422d69957051eb19f82a03ecd7dce15199cc9256c35a","first_computed_at":"2026-07-05T02:33:11.865572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:11.865572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afhuipKd/3JhB7FTpABcaNR9Eee3X4MpX+tkU3+U8ZrBK+WJX4esyRVJFZ4DCoZrGe0fom40A23ZxigUlnukDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:11.865979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.09312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29e833e28c6b6c3116764952b81495786b577f93153953909ec85c60fb56af81","sha256:840c18e439ccd3497768408d73d1141a91a9169870dbbfb0e74e5a835ac93fe6"],"state_sha256":"60bf261dff734a918a19573995595d12593045edfab428072d9176ad5bc8807b"}