{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RBWPP3MMVTEJ5WL3N57MHKARO6","short_pith_number":"pith:RBWPP3MM","canonical_record":{"source":{"id":"1211.3000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T14:31:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3a21d7bb5ead7e2197ed9fb548699d98d695bdcb23111a2afed4fc993d58004b","abstract_canon_sha256":"8b2ad6ff0d1b26d2cacb8481b2b52bb9c6a92f6ba4d420a5f144e4d26303983e"},"schema_version":"1.0"},"canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","source":{"kind":"arxiv","id":"1211.3000","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3000","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3000v2","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3000","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"RBWPP3MMVTEJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RBWPP3MMVTEJ5WL3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RBWPP3MM","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RBWPP3MMVTEJ5WL3N57MHKARO6","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T14:31:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3a21d7bb5ead7e2197ed9fb548699d98d695bdcb23111a2afed4fc993d58004b","abstract_canon_sha256":"8b2ad6ff0d1b26d2cacb8481b2b52bb9c6a92f6ba4d420a5f144e4d26303983e"},"schema_version":"1.0"},"canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.374220Z","signature_b64":"BbY1suR0j3RwMccMTTg1JEc5vI/oAaWVFrlUinfwgFOMrvtR+DzM4t4xbuKpBOPUvXLLfnrny9CpKdn+7aqVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","last_reissued_at":"2026-05-18T00:39:23.373607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.373607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3000","source_version":2,"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-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWF4LAbISBCRJb104cc2PokW/62Sc+316mzNytRa82bXQhcVN8h0456PrD55weLjfJMzEPirQx8moMv4sIm+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:18.694795Z"},"content_sha256":"20cb05a730ca515c5b5814d471c089d8f3c092d77acec96952e34bc6e2778a26","schema_version":"1.0","event_id":"sha256:20cb05a730ca515c5b5814d471c089d8f3c092d77acec96952e34bc6e2778a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RBWPP3MMVTEJ5WL3N57MHKARO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search for the end of a path in the d-dimensional grid and in other graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, G\\'abor Wiener, G\\\"unter Rote","submitted_at":"2012-11-13T14:31:47Z","abstract_excerpt":"We consider the worst-case query complexity of some variants of certain \\cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \\in V(G)$. We denote the directed graph obtained from $G$ by directing all edges in both directions by $G'$. $D$ is a directed subgraph of $G'$ which is unknown to us, except that it consists of vertex-disjoint directed paths and cycles and one of the paths originates in $s$. Our goal is to find an endvertex of a path by using as few queries as possible. A query specifies a vertex $v\\in V(G)$, and the answer is the set of the edges of $D$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3000","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"},"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-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFSqlnEPf9LVz2WWpabw7y9MqZDVpaN/NwPbe5pcB6JPRhy2xySP3PZEvG8WVbcAevxy/2Y1B3YNB1/ZUVeVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:18.695466Z"},"content_sha256":"97ce2d782af331751fca7d062589007bed2fb95b7dd3f635179713d4700b1208","schema_version":"1.0","event_id":"sha256:97ce2d782af331751fca7d062589007bed2fb95b7dd3f635179713d4700b1208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/bundle.json","state_url":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/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-26T00:20:18Z","links":{"resolver":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6","bundle":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/bundle.json","state":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RBWPP3MMVTEJ5WL3N57MHKARO6","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":"8b2ad6ff0d1b26d2cacb8481b2b52bb9c6a92f6ba4d420a5f144e4d26303983e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T14:31:47Z","title_canon_sha256":"3a21d7bb5ead7e2197ed9fb548699d98d695bdcb23111a2afed4fc993d58004b"},"schema_version":"1.0","source":{"id":"1211.3000","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3000","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3000v2","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3000","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"RBWPP3MMVTEJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RBWPP3MMVTEJ5WL3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RBWPP3MM","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:97ce2d782af331751fca7d062589007bed2fb95b7dd3f635179713d4700b1208","target":"graph","created_at":"2026-05-18T00:39:23Z","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 the worst-case query complexity of some variants of certain \\cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \\in V(G)$. We denote the directed graph obtained from $G$ by directing all edges in both directions by $G'$. $D$ is a directed subgraph of $G'$ which is unknown to us, except that it consists of vertex-disjoint directed paths and cycles and one of the paths originates in $s$. Our goal is to find an endvertex of a path by using as few queries as possible. A query specifies a vertex $v\\in V(G)$, and the answer is the set of the edges of $D$ ","authors_text":"Bal\\'azs Keszegh, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, G\\'abor Wiener, G\\\"unter Rote","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T14:31:47Z","title":"Search for the end of a path in the d-dimensional grid and in other graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3000","kind":"arxiv","version":2},"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:20cb05a730ca515c5b5814d471c089d8f3c092d77acec96952e34bc6e2778a26","target":"record","created_at":"2026-05-18T00:39:23Z","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":"8b2ad6ff0d1b26d2cacb8481b2b52bb9c6a92f6ba4d420a5f144e4d26303983e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T14:31:47Z","title_canon_sha256":"3a21d7bb5ead7e2197ed9fb548699d98d695bdcb23111a2afed4fc993d58004b"},"schema_version":"1.0","source":{"id":"1211.3000","kind":"arxiv","version":2}},"canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","first_computed_at":"2026-05-18T00:39:23.373607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.373607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbY1suR0j3RwMccMTTg1JEc5vI/oAaWVFrlUinfwgFOMrvtR+DzM4t4xbuKpBOPUvXLLfnrny9CpKdn+7aqVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.374220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3000","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20cb05a730ca515c5b5814d471c089d8f3c092d77acec96952e34bc6e2778a26","sha256:97ce2d782af331751fca7d062589007bed2fb95b7dd3f635179713d4700b1208"],"state_sha256":"95184b20656c584747ee18236b93d366f1a8ac3401432e34ae5205b71ef7220e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyuuX3Lmq1yVlYWSGNQPkm8dG0d82ujJUKS7f61LEavGrHt4iMs18oVCv616DhHnGk5dQhOWobmn7lj+xp2xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:20:18.698738Z","bundle_sha256":"35e240d44be274cc8a724021088580126a089fc729900035168b401b404837c8"}}