{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TYPAPA7VSAFNFN5XLZUXI7MC3D","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":"adc8cfa78d280657fd3db2ed1b54cb2c904fac8020a85dbf9006ce2d04f8a3b3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-03T18:40:45Z","title_canon_sha256":"2f8d322c2e3bc148a9cca21f5dcb1c67b450de355385808717763d4b5663935f"},"schema_version":"1.0","source":{"id":"2007.03425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.03425","created_at":"2026-07-05T01:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2007.03425v1","created_at":"2026-07-05T01:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03425","created_at":"2026-07-05T01:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"TYPAPA7VSAFN","created_at":"2026-07-05T01:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYPAPA7VSAFNFN5X","created_at":"2026-07-05T01:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYPAPA7V","created_at":"2026-07-05T01:17:02Z"}],"graph_snapshots":[{"event_id":"sha256:24ae82a9cb461fa2a75d6f8c26ac2957f1482115ce20ab2e9688474391138057","target":"graph","created_at":"2026-07-05T01:17:02Z","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/2007.03425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a recently introduced class of network construction problems where edges of a transportation network need to be constructed by a server (construction crew). The server has a constant construction speed which is much lower than its travel speed, so relocation times are negligible with respect to construction times. It is required to find a construction schedule that minimizes a non-decreasing function of the times when various connections of interest become operational. Most problems of this class are strongly NP-hard on general networks, but are often tree-efficient, that is, polyn","authors_text":"Igor Averbakh, Jordi Pereira","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-03T18:40:45Z","title":"Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03425","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:a0e53180709ca77570d36a9b7aefd6c8d96ef1e5f7b01766cccdbb331e414d9f","target":"record","created_at":"2026-07-05T01:17:02Z","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":"adc8cfa78d280657fd3db2ed1b54cb2c904fac8020a85dbf9006ce2d04f8a3b3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-03T18:40:45Z","title_canon_sha256":"2f8d322c2e3bc148a9cca21f5dcb1c67b450de355385808717763d4b5663935f"},"schema_version":"1.0","source":{"id":"2007.03425","kind":"arxiv","version":1}},"canonical_sha256":"9e1e0783f5900ad2b7b75e69747d82d8c0d9add1dd6b5c65c1eaa6d4629f61f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e1e0783f5900ad2b7b75e69747d82d8c0d9add1dd6b5c65c1eaa6d4629f61f3","first_computed_at":"2026-07-05T01:17:02.780716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:02.780716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"agGDKGwOq5iiNfi1fJ3m2CeDrl0nG0V0hmWI7X7+j8381rPLNXBQZolo1seNZ4GeQUw4pyBeOiPRL93JHfGODg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:02.781200Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.03425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0e53180709ca77570d36a9b7aefd6c8d96ef1e5f7b01766cccdbb331e414d9f","sha256:24ae82a9cb461fa2a75d6f8c26ac2957f1482115ce20ab2e9688474391138057"],"state_sha256":"80694a4457c86eee4dd3bc374fe7370bd241d9abf446f92ee30cee84153bcb04"}