{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Y3X7J74OJKHOSKIEYLP4OWO6NX","short_pith_number":"pith:Y3X7J74O","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"},"canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","source":{"kind":"arxiv","id":"2508.19158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19158","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19158v1","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19158","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"Y3X7J74OJKHO","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_16","alias_value":"Y3X7J74OJKHOSKIE","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_8","alias_value":"Y3X7J74O","created_at":"2026-07-05T11:59:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Y3X7J74OJKHOSKIEYLP4OWO6NX","target":"record","payload":{"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"},"canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","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"},"source_kind":"arxiv","source_id":"2508.19158","source_version":1,"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-07-05T11:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pf2NbLTCxZu98VI50XkVTTRQ5czU64rY60a4+PycvaDRLJ9Wmr4xrQARBKvndnhLZuUrjCB4lV+g0GfowprOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:24:25.940544Z"},"content_sha256":"ae1244837de144adf7a14e596e545886bd7f4974fe37a371b05eb021c2f31df2","schema_version":"1.0","event_id":"sha256:ae1244837de144adf7a14e596e545886bd7f4974fe37a371b05eb021c2f31df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Y3X7J74OJKHOSKIEYLP4OWO6NX","target":"graph","payload":{"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"},"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-07-05T11:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/+JFLCUXt//lauhyXL8JVwCGqv1LO0y4fv+Y45SKAImLo4EkQkqUYkJlDOtvj/u+riAcRIsk0LgD2S0RH7HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:24:25.941041Z"},"content_sha256":"581fa2063c25970143ea55ce73dc9d27cc9b5e8c3f15e01af1d5a9c163f086f6","schema_version":"1.0","event_id":"sha256:581fa2063c25970143ea55ce73dc9d27cc9b5e8c3f15e01af1d5a9c163f086f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/bundle.json","state_url":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/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-08-12T22:24:25Z","links":{"resolver":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX","bundle":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/bundle.json","state":"https://pith.science/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3X7J74OJKHOSKIEYLP4OWO6NX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y3X7J74OJKHOSKIEYLP4OWO6NX","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":"2558ffce5bb71668bc4131150871e33edfe87106b80299e80b5b79880abee98d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-26T16:09:00Z","title_canon_sha256":"161a997460fbe9eec885376501b1ab250419f7e32bbb8ccf274caafe1d4b25ac"},"schema_version":"1.0","source":{"id":"2508.19158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19158","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19158v1","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19158","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"Y3X7J74OJKHO","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_16","alias_value":"Y3X7J74OJKHOSKIE","created_at":"2026-07-05T11:59:38Z"},{"alias_kind":"pith_short_8","alias_value":"Y3X7J74O","created_at":"2026-07-05T11:59:38Z"}],"graph_snapshots":[{"event_id":"sha256:581fa2063c25970143ea55ce73dc9d27cc9b5e8c3f15e01af1d5a9c163f086f6","target":"graph","created_at":"2026-07-05T11:59:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.19158/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adi Rosen, Orr Fischer, Rotem Oshman, Tal Roth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-26T16:09:00Z","title":"Pointer Chasing with Unlimited Interaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19158","kind":"arxiv","version":1},"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:ae1244837de144adf7a14e596e545886bd7f4974fe37a371b05eb021c2f31df2","target":"record","created_at":"2026-07-05T11:59:38Z","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":"2558ffce5bb71668bc4131150871e33edfe87106b80299e80b5b79880abee98d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-26T16:09:00Z","title_canon_sha256":"161a997460fbe9eec885376501b1ab250419f7e32bbb8ccf274caafe1d4b25ac"},"schema_version":"1.0","source":{"id":"2508.19158","kind":"arxiv","version":1}},"canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6eff4ff8e4a8ee92904c2dfc759de6dedc6368e142ceef37584f5d9b4b67aff","first_computed_at":"2026-07-05T11:59:38.289549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:59:38.289549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PgLuScAxXGdUrY1Lb19zcTSRl8kwKemw9o9CE7FkJrBqxKX43FB5FVZq0APmqf3scBkWJ6mzba8LJOWpjPgaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:59:38.290015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.19158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1244837de144adf7a14e596e545886bd7f4974fe37a371b05eb021c2f31df2","sha256:581fa2063c25970143ea55ce73dc9d27cc9b5e8c3f15e01af1d5a9c163f086f6"],"state_sha256":"59f1dc8c42e30c37aa42146bb5c91f1c6d15c994b5090fd294319d368758a307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abzrH+6r/LypYsxF2eKZjCCs44GB5kp6NebNqKGLDEMChI7szaUxpJNE5LpRmTF7sI+9URhxZtD1yHP4aau7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:24:25.946537Z","bundle_sha256":"88b178d7d4e4051214aaf9547c487d7e27c249d607b9097364acae39e35fa39d"}}