{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZK77LGQLXX7U7PYVLJ47C4P3RQ","short_pith_number":"pith:ZK77LGQL","schema_version":"1.0","canonical_sha256":"cabff59a0bbdff4fbf155a79f171fb8c2a57f1072dceea14d9eeade57dc17281","source":{"kind":"arxiv","id":"2007.07554","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.07554","created_at":"2026-07-05T01:19:29.865103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.07554v1","created_at":"2026-07-05T01:19:29.865103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07554","created_at":"2026-07-05T01:19:29.865103+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK77LGQLXX7U","created_at":"2026-07-05T01:19:29.865103+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK77LGQLXX7U7PYV","created_at":"2026-07-05T01:19:29.865103+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK77LGQL","created_at":"2026-07-05T01:19:29.865103+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/ZK77LGQLXX7U7PYVLJ47C4P3RQ","json":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ.json","graph_json":"https://pith.science/api/pith-number/ZK77LGQLXX7U7PYVLJ47C4P3RQ/graph.json","events_json":"https://pith.science/api/pith-number/ZK77LGQLXX7U7PYVLJ47C4P3RQ/events.json","paper":"https://pith.science/paper/ZK77LGQL"},"agent_actions":{"view_html":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ","download_json":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ.json","view_paper":"https://pith.science/paper/ZK77LGQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.07554&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK77LGQLXX7U7PYVLJ47C4P3RQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK77LGQLXX7U7PYVLJ47C4P3RQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZK77LGQLXX7U7PYVLJ47C4P3RQ/action/replication_record"}},"created_at":"2026-07-05T01:19:29.865103+00:00","updated_at":"2026-07-05T01:19:29.865103+00:00"}