{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J2UFYHSIDJ6CMSZOUZEMT6IJGX","short_pith_number":"pith:J2UFYHSI","canonical_record":{"source":{"id":"2411.10996","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-17T08:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"f42fde66a9a72ba29a56b83399a46e976c1e18ce38112cec9025e73f2506323c","abstract_canon_sha256":"ddcc02eac40f7903f5bc7bec53c21b58364a14e38954616e4d3dc4cecd11012f"},"schema_version":"1.0"},"canonical_sha256":"4ea85c1e481a7c264b2ea648c9f90935d4968c26c62dec3833c275079e333567","source":{"kind":"arxiv","id":"2411.10996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10996","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10996v1","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10996","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"J2UFYHSIDJ6C","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_16","alias_value":"J2UFYHSIDJ6CMSZO","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_8","alias_value":"J2UFYHSI","created_at":"2026-07-05T09:36:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J2UFYHSIDJ6CMSZOUZEMT6IJGX","target":"record","payload":{"canonical_record":{"source":{"id":"2411.10996","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-17T08:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"f42fde66a9a72ba29a56b83399a46e976c1e18ce38112cec9025e73f2506323c","abstract_canon_sha256":"ddcc02eac40f7903f5bc7bec53c21b58364a14e38954616e4d3dc4cecd11012f"},"schema_version":"1.0"},"canonical_sha256":"4ea85c1e481a7c264b2ea648c9f90935d4968c26c62dec3833c275079e333567","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:26.907877Z","signature_b64":"kAnoTDxLNK7szrvjMVdNKoFVzWUWH3aRdDOD106IG3sgnUowtrhQy8i4f1H5ymhRCr6M8LE8gr7fl7k4qZrJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ea85c1e481a7c264b2ea648c9f90935d4968c26c62dec3833c275079e333567","last_reissued_at":"2026-07-05T09:36:26.907399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:26.907399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.10996","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-05T09:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZI2nzmL3Ur6R1veg/O2BTVTTSdCiNB58dXvUpb2Tq2U7oEma2PWrJaVdn9WI+y9n9xNQVGw+DhyBG2IJgKHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T02:15:22.922825Z"},"content_sha256":"8d616db08d5608ba4f974c73cedfea366522320fcc8a1b5168f3c7a1a95cdafd","schema_version":"1.0","event_id":"sha256:8d616db08d5608ba4f974c73cedfea366522320fcc8a1b5168f3c7a1a95cdafd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J2UFYHSIDJ6CMSZOUZEMT6IJGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Guangxu Yang, Jiapeng Zhang, Xinyu Mao","submitted_at":"2024-11-17T08:00:45Z","abstract_excerpt":"We prove an \\Omega(n/k+k) communication lower bound on (k-1)-round distributional complexity of the k-step pointer chasing problem under uniform input distribution, improving the \\Omega(n/k - k log n) lower bound due to Yehudayoff (Combinatorics Probability and Computing, 2020). Our lower bound almost matches the upper bound of O(n/k + k) communication by Nisan and Wigderson (STOC 91).\n  As part of our approach, we put forth gadgetless lifting, a new framework that lifts lower bounds for a family of restricted protocols into lower bounds for general protocols. A key step in gadgetless lifting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10996","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/2411.10996/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-05T09:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZOpzmEfzU9NKJLpz7PFIdpIjriehr7BCyFfWlf0gfDaZ7wLN3oKf9wlIYHYdw0RUZu+/AYlnkXapb+qfEMKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T02:15:22.923324Z"},"content_sha256":"5132812898e4d18f8d15b2bac14e4e1b7460b834af252b605c57f08bf45aac24","schema_version":"1.0","event_id":"sha256:5132812898e4d18f8d15b2bac14e4e1b7460b834af252b605c57f08bf45aac24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/bundle.json","state_url":"https://pith.science/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/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-24T02:15:22Z","links":{"resolver":"https://pith.science/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX","bundle":"https://pith.science/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/bundle.json","state":"https://pith.science/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2UFYHSIDJ6CMSZOUZEMT6IJGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J2UFYHSIDJ6CMSZOUZEMT6IJGX","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":"ddcc02eac40f7903f5bc7bec53c21b58364a14e38954616e4d3dc4cecd11012f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-17T08:00:45Z","title_canon_sha256":"f42fde66a9a72ba29a56b83399a46e976c1e18ce38112cec9025e73f2506323c"},"schema_version":"1.0","source":{"id":"2411.10996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10996","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10996v1","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10996","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"J2UFYHSIDJ6C","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_16","alias_value":"J2UFYHSIDJ6CMSZO","created_at":"2026-07-05T09:36:26Z"},{"alias_kind":"pith_short_8","alias_value":"J2UFYHSI","created_at":"2026-07-05T09:36:26Z"}],"graph_snapshots":[{"event_id":"sha256:5132812898e4d18f8d15b2bac14e4e1b7460b834af252b605c57f08bf45aac24","target":"graph","created_at":"2026-07-05T09:36:26Z","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/2411.10996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove an \\Omega(n/k+k) communication lower bound on (k-1)-round distributional complexity of the k-step pointer chasing problem under uniform input distribution, improving the \\Omega(n/k - k log n) lower bound due to Yehudayoff (Combinatorics Probability and Computing, 2020). Our lower bound almost matches the upper bound of O(n/k + k) communication by Nisan and Wigderson (STOC 91).\n  As part of our approach, we put forth gadgetless lifting, a new framework that lifts lower bounds for a family of restricted protocols into lower bounds for general protocols. A key step in gadgetless lifting ","authors_text":"Guangxu Yang, Jiapeng Zhang, Xinyu Mao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-17T08:00:45Z","title":"Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10996","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:8d616db08d5608ba4f974c73cedfea366522320fcc8a1b5168f3c7a1a95cdafd","target":"record","created_at":"2026-07-05T09:36:26Z","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":"ddcc02eac40f7903f5bc7bec53c21b58364a14e38954616e4d3dc4cecd11012f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-17T08:00:45Z","title_canon_sha256":"f42fde66a9a72ba29a56b83399a46e976c1e18ce38112cec9025e73f2506323c"},"schema_version":"1.0","source":{"id":"2411.10996","kind":"arxiv","version":1}},"canonical_sha256":"4ea85c1e481a7c264b2ea648c9f90935d4968c26c62dec3833c275079e333567","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ea85c1e481a7c264b2ea648c9f90935d4968c26c62dec3833c275079e333567","first_computed_at":"2026-07-05T09:36:26.907399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:26.907399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kAnoTDxLNK7szrvjMVdNKoFVzWUWH3aRdDOD106IG3sgnUowtrhQy8i4f1H5ymhRCr6M8LE8gr7fl7k4qZrJCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:26.907877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.10996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d616db08d5608ba4f974c73cedfea366522320fcc8a1b5168f3c7a1a95cdafd","sha256:5132812898e4d18f8d15b2bac14e4e1b7460b834af252b605c57f08bf45aac24"],"state_sha256":"e27c857d76a2021fc0225ffaaecb4c15f78736ecb081850c5aa31734f962198e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z01HwixsqkzsSemyHEMNEv0NTx1NkLP4Kk9jHxyydW+uO6I7KMcFRQjMG3cNslPGfkMJg7TyxjGZIVkiRZVJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T02:15:22.928430Z","bundle_sha256":"7dbfc7c6abaefb53d68a602dc3f8e6aef3a2108b05eb42a5f1ef19c6e652cf31"}}