{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TCTTAPIHUPHVY6NPIWPCGKNQ5Y","short_pith_number":"pith:TCTTAPIH","canonical_record":{"source":{"id":"1405.7596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-29T15:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"2bf6db9153ca15559f3639c8d4d04d09e76d5ce65805eb5e58fdf83b3dedc78e","abstract_canon_sha256":"a472b1ac464cb7fd287fdfdcc8037b6b6800c57aaa8cc712fac5346e39c3e07e"},"schema_version":"1.0"},"canonical_sha256":"98a7303d07a3cf5c79af459e2329b0ee1a63d58f3eb8b69c2347e2a96d3c361c","source":{"kind":"arxiv","id":"1405.7596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7596","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7596v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7596","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"TCTTAPIHUPHV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TCTTAPIHUPHVY6NP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TCTTAPIH","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TCTTAPIHUPHVY6NPIWPCGKNQ5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-29T15:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"2bf6db9153ca15559f3639c8d4d04d09e76d5ce65805eb5e58fdf83b3dedc78e","abstract_canon_sha256":"a472b1ac464cb7fd287fdfdcc8037b6b6800c57aaa8cc712fac5346e39c3e07e"},"schema_version":"1.0"},"canonical_sha256":"98a7303d07a3cf5c79af459e2329b0ee1a63d58f3eb8b69c2347e2a96d3c361c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.902035Z","signature_b64":"++Thxt+3ujnZRHtNj/ympObfdTLhczNkwhcEtODp6Xu4Ws9EWSGqeLPkb4776sLE5xJXhxCHp5+qbkrbYQF9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a7303d07a3cf5c79af459e2329b0ee1a63d58f3eb8b69c2347e2a96d3c361c","last_reissued_at":"2026-05-18T02:50:50.901579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.901579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7596","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-05-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toezXkSVq6u7xIS9NwF4RiZS8v0Aigwlx9uxz24Yfn7ryIoZ+6q7r7FkgEZR92fHI5krcrcMOMouy3xF2LoiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:32:39.938437Z"},"content_sha256":"15905c5d969652f93893c334530bfca1e48dc4b667ee00c3dc149396a4665a2f","schema_version":"1.0","event_id":"sha256:15905c5d969652f93893c334530bfca1e48dc4b667ee00c3dc149396a4665a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TCTTAPIHUPHVY6NPIWPCGKNQ5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On total communication complexity of collapsing protocols for pointer jumping problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Micha{\\l} Jastrz\\k{e}bski","submitted_at":"2014-05-29T15:57:36Z","abstract_excerpt":"This paper focuses on bounding the total communication complexity of collapsing protocols for multiparty pointer jumping problem ($MPJ_k^n$). Brody and Chakrabati in \\cite{bc08} proved that in such setting one of the players must communicate at least $n - 0.5\\log{n}$ bits. Liang in \\cite{liang} has shown protocol matching this lower bound on maximum complexity. His protocol, however, was behaving worse than the trivial one in terms of total complexity (number of bits sent by all players). He conjectured that achieving total complexity better then the trivial one is impossible. In this paper we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7596","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":""},"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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRmEPD4ivU717ynR/8x+aOKJS2Pvtfu3/0umTHPxKFT36dJc3LFL4bnbpsVBrBSsDXs7GhtrJBroHZMjTEfYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:32:39.939232Z"},"content_sha256":"cc34c045b706bb0cda001ab57c535b0f24ba26f11adb2a40b3ed8a0e1e6101ea","schema_version":"1.0","event_id":"sha256:cc34c045b706bb0cda001ab57c535b0f24ba26f11adb2a40b3ed8a0e1e6101ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/bundle.json","state_url":"https://pith.science/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/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-13T06:32:39Z","links":{"resolver":"https://pith.science/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y","bundle":"https://pith.science/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/bundle.json","state":"https://pith.science/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCTTAPIHUPHVY6NPIWPCGKNQ5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TCTTAPIHUPHVY6NPIWPCGKNQ5Y","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":"a472b1ac464cb7fd287fdfdcc8037b6b6800c57aaa8cc712fac5346e39c3e07e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-29T15:57:36Z","title_canon_sha256":"2bf6db9153ca15559f3639c8d4d04d09e76d5ce65805eb5e58fdf83b3dedc78e"},"schema_version":"1.0","source":{"id":"1405.7596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7596","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7596v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7596","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"TCTTAPIHUPHV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TCTTAPIHUPHVY6NP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TCTTAPIH","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:cc34c045b706bb0cda001ab57c535b0f24ba26f11adb2a40b3ed8a0e1e6101ea","target":"graph","created_at":"2026-05-18T02:50:50Z","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":"This paper focuses on bounding the total communication complexity of collapsing protocols for multiparty pointer jumping problem ($MPJ_k^n$). Brody and Chakrabati in \\cite{bc08} proved that in such setting one of the players must communicate at least $n - 0.5\\log{n}$ bits. Liang in \\cite{liang} has shown protocol matching this lower bound on maximum complexity. His protocol, however, was behaving worse than the trivial one in terms of total complexity (number of bits sent by all players). He conjectured that achieving total complexity better then the trivial one is impossible. In this paper we","authors_text":"Micha{\\l} Jastrz\\k{e}bski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-29T15:57:36Z","title":"On total communication complexity of collapsing protocols for pointer jumping problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7596","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:15905c5d969652f93893c334530bfca1e48dc4b667ee00c3dc149396a4665a2f","target":"record","created_at":"2026-05-18T02:50:50Z","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":"a472b1ac464cb7fd287fdfdcc8037b6b6800c57aaa8cc712fac5346e39c3e07e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-29T15:57:36Z","title_canon_sha256":"2bf6db9153ca15559f3639c8d4d04d09e76d5ce65805eb5e58fdf83b3dedc78e"},"schema_version":"1.0","source":{"id":"1405.7596","kind":"arxiv","version":1}},"canonical_sha256":"98a7303d07a3cf5c79af459e2329b0ee1a63d58f3eb8b69c2347e2a96d3c361c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98a7303d07a3cf5c79af459e2329b0ee1a63d58f3eb8b69c2347e2a96d3c361c","first_computed_at":"2026-05-18T02:50:50.901579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.901579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++Thxt+3ujnZRHtNj/ympObfdTLhczNkwhcEtODp6Xu4Ws9EWSGqeLPkb4776sLE5xJXhxCHp5+qbkrbYQF9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.902035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15905c5d969652f93893c334530bfca1e48dc4b667ee00c3dc149396a4665a2f","sha256:cc34c045b706bb0cda001ab57c535b0f24ba26f11adb2a40b3ed8a0e1e6101ea"],"state_sha256":"551b85e7d313810c8ac500904f52bf3241c8199cf426f1a15e9918c229f5fe5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IVc4Puu9tevFs69Ebx8vmz53oWKKwDRPvCzl1caQTRJbfoi6SblZ/x2dsVt7aUTWoh7axqCzO3o0VKs5iD5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:32:39.945772Z","bundle_sha256":"9075dce6a700d352a2d17ff13439181f9bf07f102b7914762b841d2f1477de9b"}}