{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RBWPP3MMVTEJ5WL3N57MHKARO6","short_pith_number":"pith:RBWPP3MM","schema_version":"1.0","canonical_sha256":"886cf7ed8cacc89ed97b6f7ec3a81177893e2f8921a44f004dbf6c2c488c9830","source":{"kind":"arxiv","id":"1211.3000","version":2},"attestation_state":"computed","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$ "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.3000","created_at":"2026-05-18T00:39:23.373717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3000v2","created_at":"2026-05-18T00:39:23.373717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3000","created_at":"2026-05-18T00:39:23.373717+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBWPP3MMVTEJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBWPP3MMVTEJ5WL3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBWPP3MM","created_at":"2026-05-18T12:27:20.899486+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/RBWPP3MMVTEJ5WL3N57MHKARO6","json":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6.json","graph_json":"https://pith.science/api/pith-number/RBWPP3MMVTEJ5WL3N57MHKARO6/graph.json","events_json":"https://pith.science/api/pith-number/RBWPP3MMVTEJ5WL3N57MHKARO6/events.json","paper":"https://pith.science/paper/RBWPP3MM"},"agent_actions":{"view_html":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6","download_json":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6.json","view_paper":"https://pith.science/paper/RBWPP3MM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3000&json=true","fetch_graph":"https://pith.science/api/pith-number/RBWPP3MMVTEJ5WL3N57MHKARO6/graph.json","fetch_events":"https://pith.science/api/pith-number/RBWPP3MMVTEJ5WL3N57MHKARO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/action/storage_attestation","attest_author":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/action/author_attestation","sign_citation":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/action/citation_signature","submit_replication":"https://pith.science/pith/RBWPP3MMVTEJ5WL3N57MHKARO6/action/replication_record"}},"created_at":"2026-05-18T00:39:23.373717+00:00","updated_at":"2026-05-18T00:39:23.373717+00:00"}