{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y3X7J74OJKHOSKIEYLP4OWO6NX","short_pith_number":"pith:Y3X7J74O","schema_version":"1.0","canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","source":{"kind":"arxiv","id":"2508.19158","version":1},"attestation_state":"computed","paper":{"title":"Pointer Chasing with Unlimited Interaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adi Rosen, Orr Fischer, Rotem Oshman, Tal Roth","submitted_at":"2025-08-26T16:09:00Z","abstract_excerpt":"Pointer-chasing is a central problem in two-party communication complexity: given input size $n$ and a parameter $k$, the two players Alice and Bob are given functions $N_A, N_B: [n] \\rightarrow [n]$, respectively, and their goal is to compute the value of $p_k$, where $p_0 = 1$, $p_1 = N_A(p_0)$, $p_2 = N_B(p_1) = N_B(N_A(p_0))$, $p_3 = N_A(p_2) = N_A(N_B(N_A(p_0)))$ and so on, applying $N_A$ in even steps and $N_B$ in odd steps, for a total of $k$ steps. It is trivial to solve the problem using $k$ communication rounds, with Alice speaking first, by simply ``chasing the function'' for $k$ st"},"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":"2508.19158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-26T16:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"161a997460fbe9eec885376501b1ab250419f7e32bbb8ccf274caafe1d4b25ac","abstract_canon_sha256":"2558ffce5bb71668bc4131150871e33edfe87106b80299e80b5b79880abee98d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:38.290015Z","signature_b64":"PgLuScAxXGdUrY1Lb19zcTSRl8kwKemw9o9CE7FkJrBqxKX43FB5FVZq0APmqf3scBkWJ6mzba8LJOWpjPgaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","last_reissued_at":"2026-07-05T11:59:38.289549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:38.289549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pointer Chasing with Unlimited Interaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adi Rosen, Orr Fischer, Rotem Oshman, Tal Roth","submitted_at":"2025-08-26T16:09:00Z","abstract_excerpt":"Pointer-chasing is a central problem in two-party communication complexity: given input size $n$ and a parameter $k$, the two players Alice and Bob are given functions $N_A, N_B: [n] \\rightarrow [n]$, respectively, and their goal is to compute the value of $p_k$, where $p_0 = 1$, $p_1 = N_A(p_0)$, $p_2 = N_B(p_1) = N_B(N_A(p_0))$, $p_3 = N_A(p_2) = N_A(N_B(N_A(p_0)))$ and so on, applying $N_A$ in even steps and $N_B$ in odd steps, for a total of $k$ steps. It is trivial to solve the problem using $k$ communication rounds, with Alice speaking first, by simply ``chasing the function'' for $k$ st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19158","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.19158/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.19158","created_at":"2026-07-05T11:59:38.289612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19158v1","created_at":"2026-07-05T11:59:38.289612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19158","created_at":"2026-07-05T11:59:38.289612+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3X7J74OJKHO","created_at":"2026-07-05T11:59:38.289612+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3X7J74OJKHOSKIE","created_at":"2026-07-05T11:59:38.289612+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3X7J74O","created_at":"2026-07-05T11:59:38.289612+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/Y3X7J74OJKHOSKIEYLP4OWO6NX","json":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX.json","graph_json":"https://pith.science/api/pith-number/Y3X7J74OJKHOSKIEYLP4OWO6NX/graph.json","events_json":"https://pith.science/api/pith-number/Y3X7J74OJKHOSKIEYLP4OWO6NX/events.json","paper":"https://pith.science/paper/Y3X7J74O"},"agent_actions":{"view_html":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX","download_json":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX.json","view_paper":"https://pith.science/paper/Y3X7J74O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19158&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3X7J74OJKHOSKIEYLP4OWO6NX/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3X7J74OJKHOSKIEYLP4OWO6NX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/action/storage_attestation","attest_author":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/action/author_attestation","sign_citation":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/action/citation_signature","submit_replication":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/action/replication_record"}},"created_at":"2026-07-05T11:59:38.289612+00:00","updated_at":"2026-07-05T11:59:38.289612+00:00"}