{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YFZVHELVZI7LP7UIZN3FU7HPPD","short_pith_number":"pith:YFZVHELV","schema_version":"1.0","canonical_sha256":"c173539175ca3eb7fe88cb765a7cef78d24a53e046b096a115e8909e94df9fc5","source":{"kind":"arxiv","id":"2407.12433","version":1},"attestation_state":"computed","paper":{"title":"Plausibly Deniable Content Discovery for Bitswap Using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Erik Daniel, Florian Tschorsch, Manuel Wedler","submitted_at":"2024-07-17T09:41:26Z","abstract_excerpt":"Bitswap is the data exchange protocol for the content-addressed peer-to-peer overlay network IPFS. During content discovery, Bitswap reveals the interest of a peer in content to all neighbors, enabling the tracking of user interests. In our paper, we propose a modification of the Bitswap protocol, which enables source obfuscation using proxies for content discovery. The proxies are selected via a random-walk. Enabling content discovery through proxies introduces plausible deniability. We evaluate the protocol modification with a simulation. The protocol modification demonstrates enhanced priva"},"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":"2407.12433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-07-17T09:41:26Z","cross_cats_sorted":[],"title_canon_sha256":"797d89b3832063d66c2f9dab7e7a91ebc6979b2cabb66fccf1b7910203f80c64","abstract_canon_sha256":"f673a7bc3b6160576150fe0dd2fa69f92248779f91de2c6bc10e5dfac4e4d47a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:04.523505Z","signature_b64":"emDbS79XCQlbilKKuhKURYGHVXvSQ7wEmCOZCZbHgi7AQSSK8o7yjnwct1OR2a+67SwFAEiPm312EfZMEigYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c173539175ca3eb7fe88cb765a7cef78d24a53e046b096a115e8909e94df9fc5","last_reissued_at":"2026-07-05T08:45:04.523011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:04.523011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plausibly Deniable Content Discovery for Bitswap Using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Erik Daniel, Florian Tschorsch, Manuel Wedler","submitted_at":"2024-07-17T09:41:26Z","abstract_excerpt":"Bitswap is the data exchange protocol for the content-addressed peer-to-peer overlay network IPFS. During content discovery, Bitswap reveals the interest of a peer in content to all neighbors, enabling the tracking of user interests. In our paper, we propose a modification of the Bitswap protocol, which enables source obfuscation using proxies for content discovery. The proxies are selected via a random-walk. Enabling content discovery through proxies introduces plausible deniability. We evaluate the protocol modification with a simulation. The protocol modification demonstrates enhanced priva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12433","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/2407.12433/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":"2407.12433","created_at":"2026-07-05T08:45:04.523081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12433v1","created_at":"2026-07-05T08:45:04.523081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12433","created_at":"2026-07-05T08:45:04.523081+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFZVHELVZI7L","created_at":"2026-07-05T08:45:04.523081+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFZVHELVZI7LP7UI","created_at":"2026-07-05T08:45:04.523081+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFZVHELV","created_at":"2026-07-05T08:45:04.523081+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/YFZVHELVZI7LP7UIZN3FU7HPPD","json":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD.json","graph_json":"https://pith.science/api/pith-number/YFZVHELVZI7LP7UIZN3FU7HPPD/graph.json","events_json":"https://pith.science/api/pith-number/YFZVHELVZI7LP7UIZN3FU7HPPD/events.json","paper":"https://pith.science/paper/YFZVHELV"},"agent_actions":{"view_html":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD","download_json":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD.json","view_paper":"https://pith.science/paper/YFZVHELV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12433&json=true","fetch_graph":"https://pith.science/api/pith-number/YFZVHELVZI7LP7UIZN3FU7HPPD/graph.json","fetch_events":"https://pith.science/api/pith-number/YFZVHELVZI7LP7UIZN3FU7HPPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD/action/storage_attestation","attest_author":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD/action/author_attestation","sign_citation":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD/action/citation_signature","submit_replication":"https://pith.science/pith/YFZVHELVZI7LP7UIZN3FU7HPPD/action/replication_record"}},"created_at":"2026-07-05T08:45:04.523081+00:00","updated_at":"2026-07-05T08:45:04.523081+00:00"}