{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UHUKCHJBWYJPBWD75FJWPTMQC2","short_pith_number":"pith:UHUKCHJB","canonical_record":{"source":{"id":"1509.07476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T19:01:34Z","cross_cats_sorted":[],"title_canon_sha256":"1f167867c3c009fb88945d9c8a7dcb9ebe0371135b2bbe4e10b384400417e8f2","abstract_canon_sha256":"ab22af6d25d4f813dab195639764fdb5e7f7d72f0f62b80c7324236f826ba8c9"},"schema_version":"1.0"},"canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","source":{"kind":"arxiv","id":"1509.07476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07476","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07476v1","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07476","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"UHUKCHJBWYJP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UHUKCHJBWYJPBWD7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UHUKCHJB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UHUKCHJBWYJPBWD75FJWPTMQC2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T19:01:34Z","cross_cats_sorted":[],"title_canon_sha256":"1f167867c3c009fb88945d9c8a7dcb9ebe0371135b2bbe4e10b384400417e8f2","abstract_canon_sha256":"ab22af6d25d4f813dab195639764fdb5e7f7d72f0f62b80c7324236f826ba8c9"},"schema_version":"1.0"},"canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.846393Z","signature_b64":"Oinvy2CqSVY/JVbOq0ecEYSDxrHeg1CzVguSly9xY+DBEAAde/PFwsY1RlcC0BcIQcut1W/dV2D/H7JuVI7YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","last_reissued_at":"2026-05-18T01:32:08.845396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.845396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07476","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUR1cDOLe71y8CW+L4tl3xD1QJdNia78NqQA0/aJQflBR/ezBVJzRXY/GGnyEQ8rNF5kSedvq9/8Ud/dsW0zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:02:59.940679Z"},"content_sha256":"89a984005b9d53fcde8d1039e37b5295261a02b48759478ff2d12b84d92146f0","schema_version":"1.0","event_id":"sha256:89a984005b9d53fcde8d1039e37b5295261a02b48759478ff2d12b84d92146f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UHUKCHJBWYJPBWD75FJWPTMQC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal small-depth lower bounds for small distance connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Igor C. Oliveira, Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2015-09-24T19:01:34Z","abstract_excerpt":"We show that any depth-$d$ circuit for determining whether an $n$-node graph has an $s$-to-$t$ path of length at most $k$ must have size $n^{\\Omega(k^{1/d}/d)}$. The previous best circuit size lower bounds for this problem were $n^{k^{\\exp(-O(d))}}$ (due to Beame, Impagliazzo, and Pitassi [BIP98]) and $n^{\\Omega((\\log k)/d)}$ (following from a recent formula size lower bound of Rossman [Ros14]). Our lower bound is quite close to optimal, since a simple construction gives depth-$d$ circuits of size $n^{O(k^{2/d})}$ for this problem (and strengthening our bound even to $n^{k^{\\Omega(1/d)}}$ woul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07476","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aoq00UbL4/Ymtrdm5e1tWSGbCwG6QGvYDWF9foZISnxAUiULR12glHGVYzQ62ucglYyExYYFAunuJ6W+IEIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:02:59.941026Z"},"content_sha256":"bd0cc56054206d8586c4b123f71028072c4b0a47cbe85d27af00b5332eb5d24d","schema_version":"1.0","event_id":"sha256:bd0cc56054206d8586c4b123f71028072c4b0a47cbe85d27af00b5332eb5d24d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/bundle.json","state_url":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/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-05-28T03:02:59Z","links":{"resolver":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2","bundle":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/bundle.json","state":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UHUKCHJBWYJPBWD75FJWPTMQC2","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":"ab22af6d25d4f813dab195639764fdb5e7f7d72f0f62b80c7324236f826ba8c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T19:01:34Z","title_canon_sha256":"1f167867c3c009fb88945d9c8a7dcb9ebe0371135b2bbe4e10b384400417e8f2"},"schema_version":"1.0","source":{"id":"1509.07476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07476","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07476v1","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07476","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"UHUKCHJBWYJP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UHUKCHJBWYJPBWD7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UHUKCHJB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:bd0cc56054206d8586c4b123f71028072c4b0a47cbe85d27af00b5332eb5d24d","target":"graph","created_at":"2026-05-18T01:32:08Z","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":"We show that any depth-$d$ circuit for determining whether an $n$-node graph has an $s$-to-$t$ path of length at most $k$ must have size $n^{\\Omega(k^{1/d}/d)}$. The previous best circuit size lower bounds for this problem were $n^{k^{\\exp(-O(d))}}$ (due to Beame, Impagliazzo, and Pitassi [BIP98]) and $n^{\\Omega((\\log k)/d)}$ (following from a recent formula size lower bound of Rossman [Ros14]). Our lower bound is quite close to optimal, since a simple construction gives depth-$d$ circuits of size $n^{O(k^{2/d})}$ for this problem (and strengthening our bound even to $n^{k^{\\Omega(1/d)}}$ woul","authors_text":"Igor C. Oliveira, Li-Yang Tan, Rocco A. Servedio, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T19:01:34Z","title":"Near-optimal small-depth lower bounds for small distance connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07476","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:89a984005b9d53fcde8d1039e37b5295261a02b48759478ff2d12b84d92146f0","target":"record","created_at":"2026-05-18T01:32:08Z","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":"ab22af6d25d4f813dab195639764fdb5e7f7d72f0f62b80c7324236f826ba8c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T19:01:34Z","title_canon_sha256":"1f167867c3c009fb88945d9c8a7dcb9ebe0371135b2bbe4e10b384400417e8f2"},"schema_version":"1.0","source":{"id":"1509.07476","kind":"arxiv","version":1}},"canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","first_computed_at":"2026-05-18T01:32:08.845396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:08.845396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oinvy2CqSVY/JVbOq0ecEYSDxrHeg1CzVguSly9xY+DBEAAde/PFwsY1RlcC0BcIQcut1W/dV2D/H7JuVI7YBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:08.846393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a984005b9d53fcde8d1039e37b5295261a02b48759478ff2d12b84d92146f0","sha256:bd0cc56054206d8586c4b123f71028072c4b0a47cbe85d27af00b5332eb5d24d"],"state_sha256":"d67157a07957364e932d9bafa7491544ba6eabd7fab69dfdc431648e28d0a04f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCoSGZUMhrdbaU/oIfoX1mhCI3qHVCmIGHCXtMgS2HsfD9X4TuZiF1eKBWTyjMghPxbnDzyA/5tL3v4MIj90CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:02:59.943138Z","bundle_sha256":"ff69ba313f29ff0110bc145f14437fbcd4b7a5fc7fbd384435ddbe36c2eb4596"}}