{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MNDYJKONL33JADWZA2JDKH66LV","short_pith_number":"pith:MNDYJKON","schema_version":"1.0","canonical_sha256":"634784a9cd5ef6900ed90692351fde5d7391954452d744335dea3f10b424cca9","source":{"kind":"arxiv","id":"1611.06632","version":2},"attestation_state":"computed","paper":{"title":"A Note on Amortized Branching Program Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin","submitted_at":"2016-11-21T01:58:12Z","abstract_excerpt":"In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size per copy of $f$. This result disproves a conjecture about non-uniform catalytic computation, rules out a certain type of bottleneck argument for proving non-monotone space lower bounds, and can be thought of as a constructive analogue of Razborov's result that submodular complexity measures have maximum value $O(n)$."},"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":"1611.06632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-21T01:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"31d68f3cf9d77e9edf7eac59461946f4fd402855bccdb630b7f3bba26a0dfc9c","abstract_canon_sha256":"3b94c92a5229a00f830f182d29dfcf021b34bedef203b913abc60222d29e90a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.476417Z","signature_b64":"6QckHah/QDoHwR0hl/iJyAueaQIU4+lLjrnqOJOGw9OCezUENETCe3GiIamCbmeXsY6W3FiJN1g+yZ2awUQ7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"634784a9cd5ef6900ed90692351fde5d7391954452d744335dea3f10b424cca9","last_reissued_at":"2026-05-18T00:50:13.475794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.475794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Amortized Branching Program Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin","submitted_at":"2016-11-21T01:58:12Z","abstract_excerpt":"In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size per copy of $f$. This result disproves a conjecture about non-uniform catalytic computation, rules out a certain type of bottleneck argument for proving non-monotone space lower bounds, and can be thought of as a constructive analogue of Razborov's result that submodular complexity measures have maximum value $O(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06632","kind":"arxiv","version":2},"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":"1611.06632","created_at":"2026-05-18T00:50:13.475882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06632v2","created_at":"2026-05-18T00:50:13.475882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06632","created_at":"2026-05-18T00:50:13.475882+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNDYJKONL33J","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNDYJKONL33JADWZ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNDYJKON","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17412","citing_title":"Catalytic Computing and Register Programs Beyond Log-Depth","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV","json":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV.json","graph_json":"https://pith.science/api/pith-number/MNDYJKONL33JADWZA2JDKH66LV/graph.json","events_json":"https://pith.science/api/pith-number/MNDYJKONL33JADWZA2JDKH66LV/events.json","paper":"https://pith.science/paper/MNDYJKON"},"agent_actions":{"view_html":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV","download_json":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV.json","view_paper":"https://pith.science/paper/MNDYJKON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06632&json=true","fetch_graph":"https://pith.science/api/pith-number/MNDYJKONL33JADWZA2JDKH66LV/graph.json","fetch_events":"https://pith.science/api/pith-number/MNDYJKONL33JADWZA2JDKH66LV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV/action/storage_attestation","attest_author":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV/action/author_attestation","sign_citation":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV/action/citation_signature","submit_replication":"https://pith.science/pith/MNDYJKONL33JADWZA2JDKH66LV/action/replication_record"}},"created_at":"2026-05-18T00:50:13.475882+00:00","updated_at":"2026-05-18T00:50:13.475882+00:00"}