{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PEQBA3DCG7H2S2OOTIV5Y2W3SB","short_pith_number":"pith:PEQBA3DC","schema_version":"1.0","canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","source":{"kind":"arxiv","id":"1204.1939","version":3},"attestation_state":"computed","paper":{"title":"Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Petra Berenbrink, Tom Friedetzky","submitted_at":"2012-04-09T17:52:17Z","abstract_excerpt":"We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use whenever there is a choice. In the simplest case, A is a uniform random choice over unvisited edges incident with the current walk position. However we do not exclude arbitrary choices of rule A. For example, the rule could be determined on-line by an adversary, or could vary from vertex to vertex.\n  For even degree expander graphs, of bounded maximum degree, "},"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":"1204.1939","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T17:52:17Z","cross_cats_sorted":["cs.DC","math.CO","math.PR"],"title_canon_sha256":"e867f3ba2e6a1f3fa87cc5fd6d7a713600616a98d3d087605e2a5cd930fb1192","abstract_canon_sha256":"d65a8118769904d27953b136e6e22bae9707e99d7551ee92e732169aedd92720"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.436450Z","signature_b64":"1lDRMgkj8jcwQIVZJC16IeRBVIm88CeNd3NsBADgsJSkuceJwHcqT2Yw9naFeN5d3PIk19a9iBI3nin+Ht3sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","last_reissued_at":"2026-05-18T02:21:16.435800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.435800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Petra Berenbrink, Tom Friedetzky","submitted_at":"2012-04-09T17:52:17Z","abstract_excerpt":"We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use whenever there is a choice. In the simplest case, A is a uniform random choice over unvisited edges incident with the current walk position. However we do not exclude arbitrary choices of rule A. For example, the rule could be determined on-line by an adversary, or could vary from vertex to vertex.\n  For even degree expander graphs, of bounded maximum degree, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1939","kind":"arxiv","version":3},"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":"1204.1939","created_at":"2026-05-18T02:21:16.435905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1939v3","created_at":"2026-05-18T02:21:16.435905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1939","created_at":"2026-05-18T02:21:16.435905+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEQBA3DCG7H2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEQBA3DCG7H2S2OO","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEQBA3DC","created_at":"2026-05-18T12:27:18.751474+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/PEQBA3DCG7H2S2OOTIV5Y2W3SB","json":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB.json","graph_json":"https://pith.science/api/pith-number/PEQBA3DCG7H2S2OOTIV5Y2W3SB/graph.json","events_json":"https://pith.science/api/pith-number/PEQBA3DCG7H2S2OOTIV5Y2W3SB/events.json","paper":"https://pith.science/paper/PEQBA3DC"},"agent_actions":{"view_html":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB","download_json":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB.json","view_paper":"https://pith.science/paper/PEQBA3DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1939&json=true","fetch_graph":"https://pith.science/api/pith-number/PEQBA3DCG7H2S2OOTIV5Y2W3SB/graph.json","fetch_events":"https://pith.science/api/pith-number/PEQBA3DCG7H2S2OOTIV5Y2W3SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/action/storage_attestation","attest_author":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/action/author_attestation","sign_citation":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/action/citation_signature","submit_replication":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/action/replication_record"}},"created_at":"2026-05-18T02:21:16.435905+00:00","updated_at":"2026-05-18T02:21:16.435905+00:00"}