{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZK77LGQLXX7U7PYVLJ47C4P3RQ","short_pith_number":"pith:ZK77LGQL","canonical_record":{"source":{"id":"2007.07554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T09:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"6f68749349d3c6bfd042d46da2c47a78b2cfb197c3e3ad99dfd6f8ca59d77802","abstract_canon_sha256":"03a62d6a224ad29d34823f6c491ad76b4e355f223dfe30d8808c5ddefe3c35d5"},"schema_version":"1.0"},"canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","source":{"kind":"arxiv","id":"2007.07554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07554","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07554v1","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07554","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZK77LGQLXX7U","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZK77LGQLXX7U7PYV","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZK77LGQL","created_at":"2026-07-05T01:19:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZK77LGQLXX7U7PYVLJ47C4P3RQ","target":"record","payload":{"canonical_record":{"source":{"id":"2007.07554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T09:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"6f68749349d3c6bfd042d46da2c47a78b2cfb197c3e3ad99dfd6f8ca59d77802","abstract_canon_sha256":"03a62d6a224ad29d34823f6c491ad76b4e355f223dfe30d8808c5ddefe3c35d5"},"schema_version":"1.0"},"canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:29.865476Z","signature_b64":"Tb1aHr0CQ9c5GEqG+DbXTOqpR+KIKRXdqoUxYmVYkRoWB5nrwH24Ei0BsRp/HVeZkYc1CIp10nNpIZY8rwLtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","last_reissued_at":"2026-07-05T01:19:29.865044Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:29.865044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.07554","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-07-05T01:19:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3Ha5vfIaB9mRKyUJCVDBBC4IoxWgJCHybA5FRSg8lVXmXAcw2Zd1br11pfKhMMBHuAGQTyl0mxbvav1SXUzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:55:53.113572Z"},"content_sha256":"af711a177cf0d87bc73c469bea5490dc50143ea5758abad8499e7361d232ad53","schema_version":"1.0","event_id":"sha256:af711a177cf0d87bc73c469bea5490dc50143ea5758abad8499e7361d232ad53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZK77LGQLXX7U7PYVLJ47C4P3RQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Weight Pairwise Distance Preservers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mojtaba Abdolmaleki, Neda Masoud, Yafeng Yin","submitted_at":"2020-07-15T09:11:31Z","abstract_excerpt":"In this paper, we study the Minimum Weight Pairwise Distance Preservers (MWPDP) problem. Consider a positively weighted undirected/directed connected graph $G = (V, E, c)$ and a subset $P$ of pairs of vertices, also called demand pairs. A subgraph $G'$ is a distance preserver with respect to $P$ if and only if every pair $(u, w) \\in P$ satisfies $dist_{G'} (u, w) = dist_{G}(u, w)$. In MWPDP problem, we aim to find the minimum-weight subgraph $G^*$ that is a distance preserver with respect to $P$. Taking a shortest path between each pair in $P$ gives us a trivial solution with the weight of at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07554","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.07554/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:19:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OT8SF1PUaQ8VGpGfwY2pbs8IvfYoUQZvX9V8duGYfrM3hQk4zbdPnodfPpre2wOYs75pZQy316jT8f3E19hQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:55:53.115083Z"},"content_sha256":"9884c2352139b850e1111efd3b5b77ea38f1f7d4b0939d074f833767d0d8a991","schema_version":"1.0","event_id":"sha256:9884c2352139b850e1111efd3b5b77ea38f1f7d4b0939d074f833767d0d8a991"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/bundle.json","state_url":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/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-08-21T08:55:53Z","links":{"resolver":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ","bundle":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/bundle.json","state":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZK77LGQLXX7U7PYVLJ47C4P3RQ","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":"03a62d6a224ad29d34823f6c491ad76b4e355f223dfe30d8808c5ddefe3c35d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T09:11:31Z","title_canon_sha256":"6f68749349d3c6bfd042d46da2c47a78b2cfb197c3e3ad99dfd6f8ca59d77802"},"schema_version":"1.0","source":{"id":"2007.07554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07554","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07554v1","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07554","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZK77LGQLXX7U","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZK77LGQLXX7U7PYV","created_at":"2026-07-05T01:19:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZK77LGQL","created_at":"2026-07-05T01:19:29Z"}],"graph_snapshots":[{"event_id":"sha256:9884c2352139b850e1111efd3b5b77ea38f1f7d4b0939d074f833767d0d8a991","target":"graph","created_at":"2026-07-05T01:19:29Z","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.07554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the Minimum Weight Pairwise Distance Preservers (MWPDP) problem. Consider a positively weighted undirected/directed connected graph $G = (V, E, c)$ and a subset $P$ of pairs of vertices, also called demand pairs. A subgraph $G'$ is a distance preserver with respect to $P$ if and only if every pair $(u, w) \\in P$ satisfies $dist_{G'} (u, w) = dist_{G}(u, w)$. In MWPDP problem, we aim to find the minimum-weight subgraph $G^*$ that is a distance preserver with respect to $P$. Taking a shortest path between each pair in $P$ gives us a trivial solution with the weight of at ","authors_text":"Mojtaba Abdolmaleki, Neda Masoud, Yafeng Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T09:11:31Z","title":"Minimum Weight Pairwise Distance Preservers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07554","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:af711a177cf0d87bc73c469bea5490dc50143ea5758abad8499e7361d232ad53","target":"record","created_at":"2026-07-05T01:19:29Z","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":"03a62d6a224ad29d34823f6c491ad76b4e355f223dfe30d8808c5ddefe3c35d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-15T09:11:31Z","title_canon_sha256":"6f68749349d3c6bfd042d46da2c47a78b2cfb197c3e3ad99dfd6f8ca59d77802"},"schema_version":"1.0","source":{"id":"2007.07554","kind":"arxiv","version":1}},"canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","first_computed_at":"2026-07-05T01:19:29.865044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:29.865044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tb1aHr0CQ9c5GEqG+DbXTOqpR+KIKRXdqoUxYmVYkRoWB5nrwH24Ei0BsRp/HVeZkYc1CIp10nNpIZY8rwLtDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:29.865476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.07554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af711a177cf0d87bc73c469bea5490dc50143ea5758abad8499e7361d232ad53","sha256:9884c2352139b850e1111efd3b5b77ea38f1f7d4b0939d074f833767d0d8a991"],"state_sha256":"bc26774b95df904b2cc9b8c6f34700a4812d334efac2adfd02c656586345e2fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdnPpTFDO2ES9O9BmruTkYv0RQPacA3bPlg7+8HCzn0/300IcE5hYs/0fP2NTIWoEasLbniJFgxg/WGdssgXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T08:55:53.122123Z","bundle_sha256":"c0b7e3ef57ff9ee3aa48db0c92bc01ac331c00dd62b49829ce80ccc93463b4e3"}}