{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HXAQXM4EEOEGJ5TDNCKMSXQGPW","short_pith_number":"pith:HXAQXM4E","schema_version":"1.0","canonical_sha256":"3dc10bb384238864f6636894c95e067d98b4211ac35ffaffbf472c4a03a7d6e5","source":{"kind":"arxiv","id":"1601.06119","version":1},"attestation_state":"computed","paper":{"title":"VOUTE-Virtual Overlays Using Tree Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Martin Beck, Stefanie Roos, Thorsten Strufe","submitted_at":"2016-01-22T19:35:07Z","abstract_excerpt":"Friend-to-friend (F2F) overlays, which restrict direct communication to mutually trusted parties, are a promising substrate for privacy-preserving communication due to their inherent membership-concealment and Sybil-resistance. Yet, existing F2F overlays suffer from a low performance, are vulnerable to denial-of-service attacks, or fail to provide anonymity. In particular, greedy embeddings allow highly efficient communication in arbitrary connectivity-restricted overlays but require communicating parties to reveal their identity. In this paper, we present a privacy-preserving routing scheme f"},"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":"1601.06119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-22T19:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"eb28a0305c7e9f9abf41585eac8b8a2e8808687490eb08a6a67078e45d764152","abstract_canon_sha256":"47ce03cc288eca40d202d37b91de90589a04af556ba4ca63c4b395aec2917d39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.235512Z","signature_b64":"U9vjIDfthiHtXWgCuPIVvDm5ifiMsg/i5wBBYzTIgzluekSrGdoxsAmVrPHqGbnh2msumgUZSAZ2GwiGfjJBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dc10bb384238864f6636894c95e067d98b4211ac35ffaffbf472c4a03a7d6e5","last_reissued_at":"2026-05-18T01:22:09.234819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.234819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VOUTE-Virtual Overlays Using Tree Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Martin Beck, Stefanie Roos, Thorsten Strufe","submitted_at":"2016-01-22T19:35:07Z","abstract_excerpt":"Friend-to-friend (F2F) overlays, which restrict direct communication to mutually trusted parties, are a promising substrate for privacy-preserving communication due to their inherent membership-concealment and Sybil-resistance. Yet, existing F2F overlays suffer from a low performance, are vulnerable to denial-of-service attacks, or fail to provide anonymity. In particular, greedy embeddings allow highly efficient communication in arbitrary connectivity-restricted overlays but require communicating parties to reveal their identity. In this paper, we present a privacy-preserving routing scheme f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06119","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":""},"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":"1601.06119","created_at":"2026-05-18T01:22:09.234922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06119v1","created_at":"2026-05-18T01:22:09.234922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06119","created_at":"2026-05-18T01:22:09.234922+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXAQXM4EEOEG","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXAQXM4EEOEGJ5TD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXAQXM4E","created_at":"2026-05-18T12:30:22.444734+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/HXAQXM4EEOEGJ5TDNCKMSXQGPW","json":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW.json","graph_json":"https://pith.science/api/pith-number/HXAQXM4EEOEGJ5TDNCKMSXQGPW/graph.json","events_json":"https://pith.science/api/pith-number/HXAQXM4EEOEGJ5TDNCKMSXQGPW/events.json","paper":"https://pith.science/paper/HXAQXM4E"},"agent_actions":{"view_html":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW","download_json":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW.json","view_paper":"https://pith.science/paper/HXAQXM4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06119&json=true","fetch_graph":"https://pith.science/api/pith-number/HXAQXM4EEOEGJ5TDNCKMSXQGPW/graph.json","fetch_events":"https://pith.science/api/pith-number/HXAQXM4EEOEGJ5TDNCKMSXQGPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW/action/storage_attestation","attest_author":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW/action/author_attestation","sign_citation":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW/action/citation_signature","submit_replication":"https://pith.science/pith/HXAQXM4EEOEGJ5TDNCKMSXQGPW/action/replication_record"}},"created_at":"2026-05-18T01:22:09.234922+00:00","updated_at":"2026-05-18T01:22:09.234922+00:00"}