{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:C4TMEOM37XTP5TGKYJTRGYZWWW","short_pith_number":"pith:C4TMEOM3","canonical_record":{"source":{"id":"2204.14247","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-29T17:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"96a3baa38850c3189e09af0c092bedcad920d2908f7bc00e7198ebf6c415bcff","abstract_canon_sha256":"7fbba0c32339cf1922754e222dd9a3bb4b58c121caeda88b81d96a038c3000c9"},"schema_version":"1.0"},"canonical_sha256":"1726c2399bfde6fecccac267136336b5b84e85958af7407d07bc4e39d11015da","source":{"kind":"arxiv","id":"2204.14247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.14247","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2204.14247v1","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.14247","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"C4TMEOM37XTP","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"C4TMEOM37XTP5TGK","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"C4TMEOM3","created_at":"2026-07-05T04:18:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:C4TMEOM37XTP5TGKYJTRGYZWWW","target":"record","payload":{"canonical_record":{"source":{"id":"2204.14247","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-29T17:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"96a3baa38850c3189e09af0c092bedcad920d2908f7bc00e7198ebf6c415bcff","abstract_canon_sha256":"7fbba0c32339cf1922754e222dd9a3bb4b58c121caeda88b81d96a038c3000c9"},"schema_version":"1.0"},"canonical_sha256":"1726c2399bfde6fecccac267136336b5b84e85958af7407d07bc4e39d11015da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:58.858456Z","signature_b64":"1+4LDe9pAaJX5h6fOu0YhWP3mTIGZytVvTcRT8MG7pVcBfw2r08RI0l9Ns21cyTaPMlU/wDg8oYWP3EkW2xiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1726c2399bfde6fecccac267136336b5b84e85958af7407d07bc4e39d11015da","last_reissued_at":"2026-07-05T04:18:58.858061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:58.858061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.14247","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-05T04:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFkXWVW+N7G0KKPa7dhWJ+xde8ze+UJ9DYimBejoDKAhIwhwlwmkItvrNxhTqhS93aa3xVXcmP5Abey6rjpmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:04:57.977211Z"},"content_sha256":"fab0f4e2e58f6a7ddbdb4beb902789b0bd63b9a4e186f64f6a12a523b2c0756b","schema_version":"1.0","event_id":"sha256:fab0f4e2e58f6a7ddbdb4beb902789b0bd63b9a4e186f64f6a12a523b2c0756b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:C4TMEOM37XTP5TGKYJTRGYZWWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Linear Error Barrier in Differentially Private Graph Distance Release","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chenglin Fan, Ping Li, Xiaoyun Li","submitted_at":"2022-04-29T17:21:06Z","abstract_excerpt":"Releasing all pairwise shortest path (APSP) distances between vertices on general graphs under weight Differential Privacy (DP) is known as a challenging task. In the previous attempt of (Sealfon 2016}, by adding Laplace noise to each edge weight or to each output distance, to achieve DP with some fixed budget, with high probability the maximal absolute error among all published pairwise distances is roughly $O(n)$ where $n$ is the number of nodes. It was shown that this error could be reduced for some special graphs, which, however, is hard for general graphs. Therefore, whether the approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.14247","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/2204.14247/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-05T04:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxevBr400D1VaJiLNe7pOnhvClO18oCmxMyHWfIyhdUNQjidZpdT2bupf8gbMmUEvp4UgZZdNE0OIjyxW77VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:04:57.977714Z"},"content_sha256":"c0aab29092ceaa03aad14a0b08246187923652da8a0d24e974880267999ac23b","schema_version":"1.0","event_id":"sha256:c0aab29092ceaa03aad14a0b08246187923652da8a0d24e974880267999ac23b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/bundle.json","state_url":"https://pith.science/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/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-17T06:04:57Z","links":{"resolver":"https://pith.science/pith/C4TMEOM37XTP5TGKYJTRGYZWWW","bundle":"https://pith.science/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/bundle.json","state":"https://pith.science/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4TMEOM37XTP5TGKYJTRGYZWWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:C4TMEOM37XTP5TGKYJTRGYZWWW","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":"7fbba0c32339cf1922754e222dd9a3bb4b58c121caeda88b81d96a038c3000c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-29T17:21:06Z","title_canon_sha256":"96a3baa38850c3189e09af0c092bedcad920d2908f7bc00e7198ebf6c415bcff"},"schema_version":"1.0","source":{"id":"2204.14247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.14247","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2204.14247v1","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.14247","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"C4TMEOM37XTP","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"C4TMEOM37XTP5TGK","created_at":"2026-07-05T04:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"C4TMEOM3","created_at":"2026-07-05T04:18:58Z"}],"graph_snapshots":[{"event_id":"sha256:c0aab29092ceaa03aad14a0b08246187923652da8a0d24e974880267999ac23b","target":"graph","created_at":"2026-07-05T04:18:58Z","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/2204.14247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Releasing all pairwise shortest path (APSP) distances between vertices on general graphs under weight Differential Privacy (DP) is known as a challenging task. In the previous attempt of (Sealfon 2016}, by adding Laplace noise to each edge weight or to each output distance, to achieve DP with some fixed budget, with high probability the maximal absolute error among all published pairwise distances is roughly $O(n)$ where $n$ is the number of nodes. It was shown that this error could be reduced for some special graphs, which, however, is hard for general graphs. Therefore, whether the approxima","authors_text":"Chenglin Fan, Ping Li, Xiaoyun Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-29T17:21:06Z","title":"Breaking the Linear Error Barrier in Differentially Private Graph Distance Release"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.14247","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:fab0f4e2e58f6a7ddbdb4beb902789b0bd63b9a4e186f64f6a12a523b2c0756b","target":"record","created_at":"2026-07-05T04:18:58Z","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":"7fbba0c32339cf1922754e222dd9a3bb4b58c121caeda88b81d96a038c3000c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-29T17:21:06Z","title_canon_sha256":"96a3baa38850c3189e09af0c092bedcad920d2908f7bc00e7198ebf6c415bcff"},"schema_version":"1.0","source":{"id":"2204.14247","kind":"arxiv","version":1}},"canonical_sha256":"1726c2399bfde6fecccac267136336b5b84e85958af7407d07bc4e39d11015da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1726c2399bfde6fecccac267136336b5b84e85958af7407d07bc4e39d11015da","first_computed_at":"2026-07-05T04:18:58.858061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:18:58.858061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1+4LDe9pAaJX5h6fOu0YhWP3mTIGZytVvTcRT8MG7pVcBfw2r08RI0l9Ns21cyTaPMlU/wDg8oYWP3EkW2xiBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:18:58.858456Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.14247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab0f4e2e58f6a7ddbdb4beb902789b0bd63b9a4e186f64f6a12a523b2c0756b","sha256:c0aab29092ceaa03aad14a0b08246187923652da8a0d24e974880267999ac23b"],"state_sha256":"a9a7f8ffacb16ba148df43743d23dee4ccf9179f3d0cc21136724ec34f917144"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMJJunG5DnLtC4WM6khQl9vOmtDYVuCOv0fU+GyYO4XJ3SrAoPvUQrWgcWz2i/Pn5xS0ae5dUmtepIEDoxaXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T06:04:57.982718Z","bundle_sha256":"5cfbc874549ff31a63b9153c84a19f1fa7a598bbfd037a6850b7f805fdb11026"}}