{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PEQBA3DCG7H2S2OOTIV5Y2W3SB","short_pith_number":"pith:PEQBA3DC","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"},"canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","source":{"kind":"arxiv","id":"1204.1939","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1939","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1939v3","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1939","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"PEQBA3DCG7H2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PEQBA3DCG7H2S2OO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PEQBA3DC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PEQBA3DCG7H2S2OOTIV5Y2W3SB","target":"record","payload":{"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"},"canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","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"},"source_kind":"arxiv","source_id":"1204.1939","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAvmSfStJSBsAuAaRYc66ZthAg0UdlQXN/XLEg8CCTbBhvula2blsQ6f24n9RzrlB9149gUN5hoq6TVwUQlhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:07:50.370059Z"},"content_sha256":"59268d3d9f3870a94a70929b002b7dc66d11f4b0631eb877ab515d282e9427cf","schema_version":"1.0","event_id":"sha256:59268d3d9f3870a94a70929b002b7dc66d11f4b0631eb877ab515d282e9427cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PEQBA3DCG7H2S2OOTIV5Y2W3SB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5IiGPaXjCJ2sZPwzzcOXkWTNUpl+uLd5E5C7VTh32JvtgKAh4nwEIBcHYHJFvb1GZczKpQDGQT/NtwaHKAOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:07:50.370440Z"},"content_sha256":"017ed8d9cd227814ca302ebeaef6c35c36e29b1df4577913697f2b361a388460","schema_version":"1.0","event_id":"sha256:017ed8d9cd227814ca302ebeaef6c35c36e29b1df4577913697f2b361a388460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/bundle.json","state_url":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T19:07:50Z","links":{"resolver":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB","bundle":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/bundle.json","state":"https://pith.science/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEQBA3DCG7H2S2OOTIV5Y2W3SB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PEQBA3DCG7H2S2OOTIV5Y2W3SB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d65a8118769904d27953b136e6e22bae9707e99d7551ee92e732169aedd92720","cross_cats_sorted":["cs.DC","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T17:52:17Z","title_canon_sha256":"e867f3ba2e6a1f3fa87cc5fd6d7a713600616a98d3d087605e2a5cd930fb1192"},"schema_version":"1.0","source":{"id":"1204.1939","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1939","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1939v3","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1939","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"PEQBA3DCG7H2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PEQBA3DCG7H2S2OO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PEQBA3DC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:017ed8d9cd227814ca302ebeaef6c35c36e29b1df4577913697f2b361a388460","target":"graph","created_at":"2026-05-18T02:21:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","authors_text":"Colin Cooper, Petra Berenbrink, Tom Friedetzky","cross_cats":["cs.DC","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T17:52:17Z","title":"Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1939","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59268d3d9f3870a94a70929b002b7dc66d11f4b0631eb877ab515d282e9427cf","target":"record","created_at":"2026-05-18T02:21:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d65a8118769904d27953b136e6e22bae9707e99d7551ee92e732169aedd92720","cross_cats_sorted":["cs.DC","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T17:52:17Z","title_canon_sha256":"e867f3ba2e6a1f3fa87cc5fd6d7a713600616a98d3d087605e2a5cd930fb1192"},"schema_version":"1.0","source":{"id":"1204.1939","kind":"arxiv","version":3}},"canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7920106c6237cfa969ce9a2bdc6adb9069dc7ec50a0cb59d08c1c6f1f1aeeba8","first_computed_at":"2026-05-18T02:21:16.435800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:16.435800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1lDRMgkj8jcwQIVZJC16IeRBVIm88CeNd3NsBADgsJSkuceJwHcqT2Yw9naFeN5d3PIk19a9iBI3nin+Ht3sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.436450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1939","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59268d3d9f3870a94a70929b002b7dc66d11f4b0631eb877ab515d282e9427cf","sha256:017ed8d9cd227814ca302ebeaef6c35c36e29b1df4577913697f2b361a388460"],"state_sha256":"65033d6a4752bd973ff817a8b2c2c98a3778d6aba77be729937e8ec913eb1fb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZ0FmNLu//rG2fn0TDJFH10WP3SWclpP6BhX8JBm9Qjj6eOXbPgtQssgDTn3gCYewUPZABRUsimrmPRdg1/YDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:07:50.372717Z","bundle_sha256":"2d015478b95099d2391ff6d75f9d60a2f750a9b2ce049668146badca87c4fbce"}}