{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3XAPYDABYWPZ3ZCKPHAMTRFXGA","short_pith_number":"pith:3XAPYDAB","schema_version":"1.0","canonical_sha256":"ddc0fc0c01c59f9de44a79c0c9c4b7302095b21ee2854ffea79ca99bec0453e4","source":{"kind":"arxiv","id":"1911.08875","version":4},"attestation_state":"computed","paper":{"title":"Anonymous Stochastic Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.GT","authors_text":"Kuang Xu, Mine Su Erturk","submitted_at":"2019-10-30T04:45:43Z","abstract_excerpt":"We propose and analyze a recipient-anonymous stochastic routing model to study a fundamental trade-off between anonymity and routing delay. An agent wants to quickly reach a goal vertex in a network through a sequence of routing actions, while an overseeing adversary observes the agent's entire trajectory and tries to identify her goal among those vertices traversed. We are interested in understanding the probability that the adversary can correctly identify the agent's goal (anonymity), as a function of the time it takes the agent to reach it (delay). A key feature of our model is the presenc"},"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":"1911.08875","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-10-30T04:45:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ec823aa41af0caf1f51207ad6f1bf41265cc5359e64a7a00f2ee60223419c666","abstract_canon_sha256":"c5eacbbd32ee32b271f6343e69823074ffe9928b4b23d528fbfe92995caa0155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:51.576088Z","signature_b64":"V7v8n+kb8LvfFbqEClHN2/byqJ9L3LtijESTiCTXgnVCAyoNXvDE78AcUyHWbP+GVlpu0MYtscf6NuifKRuNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc0fc0c01c59f9de44a79c0c9c4b7302095b21ee2854ffea79ca99bec0453e4","last_reissued_at":"2026-07-05T02:02:51.575548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:51.575548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Stochastic Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.GT","authors_text":"Kuang Xu, Mine Su Erturk","submitted_at":"2019-10-30T04:45:43Z","abstract_excerpt":"We propose and analyze a recipient-anonymous stochastic routing model to study a fundamental trade-off between anonymity and routing delay. An agent wants to quickly reach a goal vertex in a network through a sequence of routing actions, while an overseeing adversary observes the agent's entire trajectory and tries to identify her goal among those vertices traversed. We are interested in understanding the probability that the adversary can correctly identify the agent's goal (anonymity), as a function of the time it takes the agent to reach it (delay). A key feature of our model is the presenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08875","kind":"arxiv","version":4},"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/1911.08875/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":"1911.08875","created_at":"2026-07-05T02:02:51.575613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08875v4","created_at":"2026-07-05T02:02:51.575613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08875","created_at":"2026-07-05T02:02:51.575613+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XAPYDABYWPZ","created_at":"2026-07-05T02:02:51.575613+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XAPYDABYWPZ3ZCK","created_at":"2026-07-05T02:02:51.575613+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XAPYDAB","created_at":"2026-07-05T02:02:51.575613+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02717","citing_title":"Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA","json":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA.json","graph_json":"https://pith.science/api/pith-number/3XAPYDABYWPZ3ZCKPHAMTRFXGA/graph.json","events_json":"https://pith.science/api/pith-number/3XAPYDABYWPZ3ZCKPHAMTRFXGA/events.json","paper":"https://pith.science/paper/3XAPYDAB"},"agent_actions":{"view_html":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA","download_json":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA.json","view_paper":"https://pith.science/paper/3XAPYDAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08875&json=true","fetch_graph":"https://pith.science/api/pith-number/3XAPYDABYWPZ3ZCKPHAMTRFXGA/graph.json","fetch_events":"https://pith.science/api/pith-number/3XAPYDABYWPZ3ZCKPHAMTRFXGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA/action/storage_attestation","attest_author":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA/action/author_attestation","sign_citation":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA/action/citation_signature","submit_replication":"https://pith.science/pith/3XAPYDABYWPZ3ZCKPHAMTRFXGA/action/replication_record"}},"created_at":"2026-07-05T02:02:51.575613+00:00","updated_at":"2026-07-05T02:02:51.575613+00:00"}