{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7C22VQ6B6V3VOPNF4REOWHGS7Z","short_pith_number":"pith:7C22VQ6B","schema_version":"1.0","canonical_sha256":"f8b5aac3c1f577573da5e448eb1cd2fe59b7cf32144891eb5c473d10189ca76d","source":{"kind":"arxiv","id":"2412.02329","version":2},"attestation_state":"computed","paper":{"title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"Jos\\'ee Desharnais, Marc-Olivier Killijian, Nadia Tawbi, S\\'ebastien Gambs, Sofiane Azogagh, Zelma Aubin Birba","submitted_at":"2024-12-03T09:42:28Z","abstract_excerpt":"Cryptographic approaches, such as secure multiparty computation, can be used to compute in a secure manner the function of a distributed graph without centralizing the data of each participant. However, the output of the protocol itself can leak sensitive information about the structure of the original graph. In particular, in this work we propose an approach by which an adversary observing the result of a private protocol for the computation of the number of common neighbors between all pairs of vertices, can reconstruct the adjacency matrix of the graph. In fact, this can only be done up to "},"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":"2412.02329","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-12-03T09:42:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8735a24fc950d4fcc31c43f34e9bbf449aa5f542cc7577f0da9335a59d8bb39c","abstract_canon_sha256":"290aba7934e87683006f7893f9f11cf7408de5947cfe605507061764c8470f22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:17.161435Z","signature_b64":"98CBzh3IMvFpVDAV0xWiU+uBaBgGgS+57MySlLK6vF+T6PAsfrJeYLk+arm7CUKjB8/rHNeYqeYZbz0wj2bHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b5aac3c1f577573da5e448eb1cd2fe59b7cf32144891eb5c473d10189ca76d","last_reissued_at":"2026-07-05T09:45:17.160941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:17.160941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"Jos\\'ee Desharnais, Marc-Olivier Killijian, Nadia Tawbi, S\\'ebastien Gambs, Sofiane Azogagh, Zelma Aubin Birba","submitted_at":"2024-12-03T09:42:28Z","abstract_excerpt":"Cryptographic approaches, such as secure multiparty computation, can be used to compute in a secure manner the function of a distributed graph without centralizing the data of each participant. However, the output of the protocol itself can leak sensitive information about the structure of the original graph. In particular, in this work we propose an approach by which an adversary observing the result of a private protocol for the computation of the number of common neighbors between all pairs of vertices, can reconstruct the adjacency matrix of the graph. In fact, this can only be done up to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02329","kind":"arxiv","version":2},"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/2412.02329/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":"2412.02329","created_at":"2026-07-05T09:45:17.160995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02329v2","created_at":"2026-07-05T09:45:17.160995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02329","created_at":"2026-07-05T09:45:17.160995+00:00"},{"alias_kind":"pith_short_12","alias_value":"7C22VQ6B6V3V","created_at":"2026-07-05T09:45:17.160995+00:00"},{"alias_kind":"pith_short_16","alias_value":"7C22VQ6B6V3VOPNF","created_at":"2026-07-05T09:45:17.160995+00:00"},{"alias_kind":"pith_short_8","alias_value":"7C22VQ6B","created_at":"2026-07-05T09:45:17.160995+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/7C22VQ6B6V3VOPNF4REOWHGS7Z","json":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z.json","graph_json":"https://pith.science/api/pith-number/7C22VQ6B6V3VOPNF4REOWHGS7Z/graph.json","events_json":"https://pith.science/api/pith-number/7C22VQ6B6V3VOPNF4REOWHGS7Z/events.json","paper":"https://pith.science/paper/7C22VQ6B"},"agent_actions":{"view_html":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z","download_json":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z.json","view_paper":"https://pith.science/paper/7C22VQ6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02329&json=true","fetch_graph":"https://pith.science/api/pith-number/7C22VQ6B6V3VOPNF4REOWHGS7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/7C22VQ6B6V3VOPNF4REOWHGS7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z/action/storage_attestation","attest_author":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z/action/author_attestation","sign_citation":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z/action/citation_signature","submit_replication":"https://pith.science/pith/7C22VQ6B6V3VOPNF4REOWHGS7Z/action/replication_record"}},"created_at":"2026-07-05T09:45:17.160995+00:00","updated_at":"2026-07-05T09:45:17.160995+00:00"}