{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UHUKCHJBWYJPBWD75FJWPTMQC2","short_pith_number":"pith:UHUKCHJB","schema_version":"1.0","canonical_sha256":"a1e8a11d21b612f0d87fe95367cd90168908324371119bbc026e78d48b3a54d5","source":{"kind":"arxiv","id":"1509.07476","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07476","created_at":"2026-05-18T01:32:08.845795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07476v1","created_at":"2026-05-18T01:32:08.845795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07476","created_at":"2026-05-18T01:32:08.845795+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHUKCHJBWYJP","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHUKCHJBWYJPBWD7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHUKCHJB","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2","json":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2.json","graph_json":"https://pith.science/api/pith-number/UHUKCHJBWYJPBWD75FJWPTMQC2/graph.json","events_json":"https://pith.science/api/pith-number/UHUKCHJBWYJPBWD75FJWPTMQC2/events.json","paper":"https://pith.science/paper/UHUKCHJB"},"agent_actions":{"view_html":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2","download_json":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2.json","view_paper":"https://pith.science/paper/UHUKCHJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07476&json=true","fetch_graph":"https://pith.science/api/pith-number/UHUKCHJBWYJPBWD75FJWPTMQC2/graph.json","fetch_events":"https://pith.science/api/pith-number/UHUKCHJBWYJPBWD75FJWPTMQC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/action/storage_attestation","attest_author":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/action/author_attestation","sign_citation":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/action/citation_signature","submit_replication":"https://pith.science/pith/UHUKCHJBWYJPBWD75FJWPTMQC2/action/replication_record"}},"created_at":"2026-05-18T01:32:08.845795+00:00","updated_at":"2026-05-18T01:32:08.845795+00:00"}