{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UTUKVFE2CKQWSVXRIAFF6LY3MP","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":"a4d1dbcfb7cd477d17de878a67650c75ad82688b9089e0cbf758be25d0b52c41","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-09T16:19:21Z","title_canon_sha256":"88478c11c1c593e0ea9f401479f54fa364054eccba0266152f5326202e6f96bc"},"schema_version":"1.0","source":{"id":"1908.03519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03519","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03519v1","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03519","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"UTUKVFE2CKQW","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"UTUKVFE2CKQWSVXR","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"UTUKVFE2","created_at":"2026-07-04T23:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:ede98dcdb4dfcc4535deab8b1bb7d622a7cc8649eb9dbd57d1c35e66a8c1c30e","target":"graph","created_at":"2026-07-04T23:52:40Z","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/1908.03519/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured on a set of intersecting paths between a subset of boundary vertices, and even the underlying graph when this is not known. Recent work has established conditions under which the underlying directed graph can be recovered exactly the pairwise Path Correlation Data, namely, the set of weights of intersection of each pair of directed paths to and from each endp","authors_text":"Gregory Berkolaiko, Mahmood Ettehad, Nick Duffield","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03519","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:10fa2216723fd8b71398cb3409377f69f6c0062bdea5abe0888944bcb6de0191","target":"record","created_at":"2026-07-04T23:52:40Z","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":"a4d1dbcfb7cd477d17de878a67650c75ad82688b9089e0cbf758be25d0b52c41","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-09T16:19:21Z","title_canon_sha256":"88478c11c1c593e0ea9f401479f54fa364054eccba0266152f5326202e6f96bc"},"schema_version":"1.0","source":{"id":"1908.03519","kind":"arxiv","version":1}},"canonical_sha256":"a4e8aa949a12a16956f1400a5f2f1b63d8e4660b64d376c9a50ea72365b8214b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4e8aa949a12a16956f1400a5f2f1b63d8e4660b64d376c9a50ea72365b8214b","first_computed_at":"2026-07-04T23:52:40.644586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:40.644586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2em6wPKbS1xnPlNT1MqovucwHV+Wz/8GfCTAtaiWpYNzjOFYB93eSc7Jpf/g8nKCstug+YBnmtU72LeLHhTDA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:40.645112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10fa2216723fd8b71398cb3409377f69f6c0062bdea5abe0888944bcb6de0191","sha256:ede98dcdb4dfcc4535deab8b1bb7d622a7cc8649eb9dbd57d1c35e66a8c1c30e"],"state_sha256":"dcd22407ac6b734a7f9c810943ff89c9c31a6ecd1217f9ff9bc764ffaa7459b4"}