{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O3S4D4QLNP6YKXS6NRK3YOD2XX","short_pith_number":"pith:O3S4D4QL","canonical_record":{"source":{"id":"1301.0862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-05T03:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"95da8ba00a29444695049a16603b064ebaae6db1f859228b52ed28889c477c72","abstract_canon_sha256":"834d2a043e6f4cd0222e59a0aba342318f02b2c2a8af000c867481dd5740530a"},"schema_version":"1.0"},"canonical_sha256":"76e5c1f20b6bfd855e5e6c55bc387abdc501f212d3040893d4267b4d07c49fae","source":{"kind":"arxiv","id":"1301.0862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0862","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0862v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0862","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"O3S4D4QLNP6Y","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O3S4D4QLNP6YKXS6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O3S4D4QL","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O3S4D4QLNP6YKXS6NRK3YOD2XX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-05T03:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"95da8ba00a29444695049a16603b064ebaae6db1f859228b52ed28889c477c72","abstract_canon_sha256":"834d2a043e6f4cd0222e59a0aba342318f02b2c2a8af000c867481dd5740530a"},"schema_version":"1.0"},"canonical_sha256":"76e5c1f20b6bfd855e5e6c55bc387abdc501f212d3040893d4267b4d07c49fae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.522333Z","signature_b64":"xBrze93aWIjeTGPsutrpquqnqpDDCLzCI5De8/KfFzlAtYqJ/j8xj690YTya+BRAFyM4ZRx0GAhTFrdhQe+FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76e5c1f20b6bfd855e5e6c55bc387abdc501f212d3040893d4267b4d07c49fae","last_reissued_at":"2026-05-18T03:37:07.521501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.521501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0862","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UdpO3cNM91K0Xvh13TTGccmyeVLZKBIU44jZSvn1OxGPMO4h54ZGQBMPXchkgR5aIjCaz4LCmfE8R/zo0VrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:38:02.988490Z"},"content_sha256":"e17c09d4ce888942bed621317d6a116e73c1bdcd7bb24c0dd0defe6ed7e72b25","schema_version":"1.0","event_id":"sha256:e17c09d4ce888942bed621317d6a116e73c1bdcd7bb24c0dd0defe6ed7e72b25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O3S4D4QLNP6YKXS6NRK3YOD2XX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Lower Bound Methods for Tree-like Cutting Plane Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Apon","submitted_at":"2013-01-05T03:10:49Z","abstract_excerpt":"In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, \"Tree-CP proofs\") using Karchmer-Widgerson type communication games (henceforth, \"KW games\") are presented: The first, applicable to Tree-CP proofs with bounded coefficients, translates Omega(t) deterministic lower bounds on KW games to 2^Omega(t/log n) lower bounds on Tree-CP proof size. The second, applicable to Tree-CP proofs with unbounded coefficients, translates Omega(t) randomized lower bounds on KW games to 2^Omega(t/log^2 n) lower bounds on Tree-CP proof "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0862","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPx7ig0sPtNrNVrdqefLwm06r22PsHlrGTi4sDlIt5pfVO4Lo7O6Yv7tvojDYhPhDjVrYZfHgg5dLn2uxI5IBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:38:02.989059Z"},"content_sha256":"67b97d74402bcc4997c380fdf14c7685ca9e0217cac4231ec2dfe6abceff202d","schema_version":"1.0","event_id":"sha256:67b97d74402bcc4997c380fdf14c7685ca9e0217cac4231ec2dfe6abceff202d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/bundle.json","state_url":"https://pith.science/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/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-06-06T18:38:02Z","links":{"resolver":"https://pith.science/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX","bundle":"https://pith.science/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/bundle.json","state":"https://pith.science/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3S4D4QLNP6YKXS6NRK3YOD2XX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O3S4D4QLNP6YKXS6NRK3YOD2XX","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":"834d2a043e6f4cd0222e59a0aba342318f02b2c2a8af000c867481dd5740530a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-05T03:10:49Z","title_canon_sha256":"95da8ba00a29444695049a16603b064ebaae6db1f859228b52ed28889c477c72"},"schema_version":"1.0","source":{"id":"1301.0862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0862","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0862v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0862","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"O3S4D4QLNP6Y","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O3S4D4QLNP6YKXS6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O3S4D4QL","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:67b97d74402bcc4997c380fdf14c7685ca9e0217cac4231ec2dfe6abceff202d","target":"graph","created_at":"2026-05-18T03:37:07Z","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":"In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, \"Tree-CP proofs\") using Karchmer-Widgerson type communication games (henceforth, \"KW games\") are presented: The first, applicable to Tree-CP proofs with bounded coefficients, translates Omega(t) deterministic lower bounds on KW games to 2^Omega(t/log n) lower bounds on Tree-CP proof size. The second, applicable to Tree-CP proofs with unbounded coefficients, translates Omega(t) randomized lower bounds on KW games to 2^Omega(t/log^2 n) lower bounds on Tree-CP proof ","authors_text":"Daniel Apon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-05T03:10:49Z","title":"On Lower Bound Methods for Tree-like Cutting Plane Proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0862","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:e17c09d4ce888942bed621317d6a116e73c1bdcd7bb24c0dd0defe6ed7e72b25","target":"record","created_at":"2026-05-18T03:37:07Z","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":"834d2a043e6f4cd0222e59a0aba342318f02b2c2a8af000c867481dd5740530a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-05T03:10:49Z","title_canon_sha256":"95da8ba00a29444695049a16603b064ebaae6db1f859228b52ed28889c477c72"},"schema_version":"1.0","source":{"id":"1301.0862","kind":"arxiv","version":1}},"canonical_sha256":"76e5c1f20b6bfd855e5e6c55bc387abdc501f212d3040893d4267b4d07c49fae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76e5c1f20b6bfd855e5e6c55bc387abdc501f212d3040893d4267b4d07c49fae","first_computed_at":"2026-05-18T03:37:07.521501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:07.521501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xBrze93aWIjeTGPsutrpquqnqpDDCLzCI5De8/KfFzlAtYqJ/j8xj690YTya+BRAFyM4ZRx0GAhTFrdhQe+FCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:07.522333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17c09d4ce888942bed621317d6a116e73c1bdcd7bb24c0dd0defe6ed7e72b25","sha256:67b97d74402bcc4997c380fdf14c7685ca9e0217cac4231ec2dfe6abceff202d"],"state_sha256":"a53fc08b140fc7e7379c4ea520ad964f7d34327a1a4932393a13b6177d5903b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GNlnuVk6c4CzHYaehi14iE+KgTAs3SPvS9bmPF1oQ0IHwdyoIlkayEd4U4WDI3Vpuf6vWJl/tZRpfe8QMvkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:38:02.992132Z","bundle_sha256":"3e85af360ed07d21388d06525b4b0cb10109881d8c02858f81992ac8497ab9ec"}}