{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GPL5VBFOEYXGGSAFMIVYY6R75X","short_pith_number":"pith:GPL5VBFO","schema_version":"1.0","canonical_sha256":"33d7da84ae262e634805622b8c7a3fedfaed2d729d548a2ac291b59a263d975b","source":{"kind":"arxiv","id":"1608.08080","version":1},"attestation_state":"computed","paper":{"title":"A Multi-Urn Model for Network Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher E. Marks, Tauhid Zaman","submitted_at":"2016-08-24T15:32:49Z","abstract_excerpt":"We consider the problem of finding a specific target individual hiding in a social network. We propose a method for network vertex search that looks for the target vertex by sequentially examining the neighbors of a set of \"known\" vertices to which the target vertex may have connected. The objective is to find the target vertex as quickly as possible from amongst the neighbors of the known vertices. We model this type of search as successively drawing marbles from a set of urns, where each urn represents one of the known vertices and the marbles in each urn represent the respective vertex's ne"},"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":"1608.08080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T15:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"d616e290de219661f4bb6289776beb510e60b69698cf14fe6409e27b94341bcb","abstract_canon_sha256":"bbd4978cc5023cf7391f170d0736b43cc9e1a5f6477672ba40dd8d04f5b3381b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:48.743057Z","signature_b64":"g+Kprt66yKoVSQzpxhuNxBzJagbEApw482pMCtC+eeKtutK4C/QVXzhRh/qCL/BavZFhzycFdbN8NKT7ui10BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d7da84ae262e634805622b8c7a3fedfaed2d729d548a2ac291b59a263d975b","last_reissued_at":"2026-05-18T01:07:48.742670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:48.742670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multi-Urn Model for Network Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher E. Marks, Tauhid Zaman","submitted_at":"2016-08-24T15:32:49Z","abstract_excerpt":"We consider the problem of finding a specific target individual hiding in a social network. We propose a method for network vertex search that looks for the target vertex by sequentially examining the neighbors of a set of \"known\" vertices to which the target vertex may have connected. The objective is to find the target vertex as quickly as possible from amongst the neighbors of the known vertices. We model this type of search as successively drawing marbles from a set of urns, where each urn represents one of the known vertices and the marbles in each urn represent the respective vertex's ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08080","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":"1608.08080","created_at":"2026-05-18T01:07:48.742732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08080v1","created_at":"2026-05-18T01:07:48.742732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08080","created_at":"2026-05-18T01:07:48.742732+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPL5VBFOEYXG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPL5VBFOEYXGGSAF","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPL5VBFO","created_at":"2026-05-18T12:30:19.053100+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/GPL5VBFOEYXGGSAFMIVYY6R75X","json":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X.json","graph_json":"https://pith.science/api/pith-number/GPL5VBFOEYXGGSAFMIVYY6R75X/graph.json","events_json":"https://pith.science/api/pith-number/GPL5VBFOEYXGGSAFMIVYY6R75X/events.json","paper":"https://pith.science/paper/GPL5VBFO"},"agent_actions":{"view_html":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X","download_json":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X.json","view_paper":"https://pith.science/paper/GPL5VBFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08080&json=true","fetch_graph":"https://pith.science/api/pith-number/GPL5VBFOEYXGGSAFMIVYY6R75X/graph.json","fetch_events":"https://pith.science/api/pith-number/GPL5VBFOEYXGGSAFMIVYY6R75X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X/action/storage_attestation","attest_author":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X/action/author_attestation","sign_citation":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X/action/citation_signature","submit_replication":"https://pith.science/pith/GPL5VBFOEYXGGSAFMIVYY6R75X/action/replication_record"}},"created_at":"2026-05-18T01:07:48.742732+00:00","updated_at":"2026-05-18T01:07:48.742732+00:00"}