{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UF42LYJIS6LW5CU2R4WCRGCJXX","short_pith_number":"pith:UF42LYJI","schema_version":"1.0","canonical_sha256":"a179a5e12897976e8a9a8f2c289849bdc5cdbb23a717595c80408932b08be442","source":{"kind":"arxiv","id":"1604.08052","version":2},"attestation_state":"computed","paper":{"title":"About the distance between random walkers on some graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antonia Foldes, Endre Csaki, Pal Revesz","submitted_at":"2016-04-27T13:05:11Z","abstract_excerpt":"We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers."},"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":"1604.08052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-27T13:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"36dc1609cf673197b1d09a380fd8b6a3ea393d89451e357d2b1bc420ab4d3be6","abstract_canon_sha256":"560a4bfb6840366a913a9d76a0f2168b089fdb9cc20684f627501933905c539c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:30.394556Z","signature_b64":"QYL/mViOfGJQ4PkOcGOiOzyqI418Evx2MyVCzr4RBJts1ACel+jcn5eyv4RCR2dKBV1hT0UnPlZl7iucFPpvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a179a5e12897976e8a9a8f2c289849bdc5cdbb23a717595c80408932b08be442","last_reissued_at":"2026-05-18T01:10:30.393928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:30.393928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"About the distance between random walkers on some graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antonia Foldes, Endre Csaki, Pal Revesz","submitted_at":"2016-04-27T13:05:11Z","abstract_excerpt":"We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08052","kind":"arxiv","version":2},"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":"1604.08052","created_at":"2026-05-18T01:10:30.394021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08052v2","created_at":"2026-05-18T01:10:30.394021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08052","created_at":"2026-05-18T01:10:30.394021+00:00"},{"alias_kind":"pith_short_12","alias_value":"UF42LYJIS6LW","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UF42LYJIS6LW5CU2","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UF42LYJI","created_at":"2026-05-18T12:30:46.583412+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/UF42LYJIS6LW5CU2R4WCRGCJXX","json":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX.json","graph_json":"https://pith.science/api/pith-number/UF42LYJIS6LW5CU2R4WCRGCJXX/graph.json","events_json":"https://pith.science/api/pith-number/UF42LYJIS6LW5CU2R4WCRGCJXX/events.json","paper":"https://pith.science/paper/UF42LYJI"},"agent_actions":{"view_html":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX","download_json":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX.json","view_paper":"https://pith.science/paper/UF42LYJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08052&json=true","fetch_graph":"https://pith.science/api/pith-number/UF42LYJIS6LW5CU2R4WCRGCJXX/graph.json","fetch_events":"https://pith.science/api/pith-number/UF42LYJIS6LW5CU2R4WCRGCJXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX/action/storage_attestation","attest_author":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX/action/author_attestation","sign_citation":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX/action/citation_signature","submit_replication":"https://pith.science/pith/UF42LYJIS6LW5CU2R4WCRGCJXX/action/replication_record"}},"created_at":"2026-05-18T01:10:30.394021+00:00","updated_at":"2026-05-18T01:10:30.394021+00:00"}