{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FS5JRNWHPV55342KM4R2LYMQCY","short_pith_number":"pith:FS5JRNWH","schema_version":"1.0","canonical_sha256":"2cba98b6c77d7bddf34a6723a5e190160547a8f1b2b28faac6931497897ccee5","source":{"kind":"arxiv","id":"1603.06109","version":1},"attestation_state":"computed","paper":{"title":"Better bounds for coalescing-branching random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Mitzenmacher, Rajmohan Rajaraman, Scott Roche","submitted_at":"2016-03-19T16:04:21Z","abstract_excerpt":"Coalescing-branching random walks, or {\\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each time step a subset of the vertices are active; each active vertex chooses $k$ random neighbors (sampled independently and uniformly with replacement) that become active at the next step, and these are the only active vertices at the next step. A natural quantity to study for cobra walks is the cover time, which corresponds to the expected time when all nodes"},"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":"1603.06109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-19T16:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"77ca21ba823447aa926e6cf201239bbd3675f99cc1e2c1456b94160f22165243","abstract_canon_sha256":"3d25a874838d807bb50fd60d4d11c00923a65612e8eb2ca581f4f4aeb2746b75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:51.781253Z","signature_b64":"BruWDNRzU1T477M6Vemh2tQx6hk0DkHf+5QPxJSsNy2U9/gr0esOySrEnn6FszOAvlj/aAsp0OeCXrc3Ly0KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cba98b6c77d7bddf34a6723a5e190160547a8f1b2b28faac6931497897ccee5","last_reissued_at":"2026-05-18T01:18:51.780782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:51.780782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better bounds for coalescing-branching random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Mitzenmacher, Rajmohan Rajaraman, Scott Roche","submitted_at":"2016-03-19T16:04:21Z","abstract_excerpt":"Coalescing-branching random walks, or {\\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each time step a subset of the vertices are active; each active vertex chooses $k$ random neighbors (sampled independently and uniformly with replacement) that become active at the next step, and these are the only active vertices at the next step. A natural quantity to study for cobra walks is the cover time, which corresponds to the expected time when all nodes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06109","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":"1603.06109","created_at":"2026-05-18T01:18:51.780885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06109v1","created_at":"2026-05-18T01:18:51.780885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06109","created_at":"2026-05-18T01:18:51.780885+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS5JRNWHPV55","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS5JRNWHPV55342K","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS5JRNWH","created_at":"2026-05-18T12:30:15.759754+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/FS5JRNWHPV55342KM4R2LYMQCY","json":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY.json","graph_json":"https://pith.science/api/pith-number/FS5JRNWHPV55342KM4R2LYMQCY/graph.json","events_json":"https://pith.science/api/pith-number/FS5JRNWHPV55342KM4R2LYMQCY/events.json","paper":"https://pith.science/paper/FS5JRNWH"},"agent_actions":{"view_html":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY","download_json":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY.json","view_paper":"https://pith.science/paper/FS5JRNWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06109&json=true","fetch_graph":"https://pith.science/api/pith-number/FS5JRNWHPV55342KM4R2LYMQCY/graph.json","fetch_events":"https://pith.science/api/pith-number/FS5JRNWHPV55342KM4R2LYMQCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY/action/storage_attestation","attest_author":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY/action/author_attestation","sign_citation":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY/action/citation_signature","submit_replication":"https://pith.science/pith/FS5JRNWHPV55342KM4R2LYMQCY/action/replication_record"}},"created_at":"2026-05-18T01:18:51.780885+00:00","updated_at":"2026-05-18T01:18:51.780885+00:00"}