{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RWQBJOLNOXCKPKDK4JU7H7Z3LI","short_pith_number":"pith:RWQBJOLN","schema_version":"1.0","canonical_sha256":"8da014b96d75c4a7a86ae269f3ff3b5a1b7a1b63d42d44c9a09a2ef92ca10979","source":{"kind":"arxiv","id":"0910.1427","version":1},"attestation_state":"computed","paper":{"title":"Balancing Bounded Treewidth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma M.N, Maurice Jansen","submitted_at":"2009-10-08T06:56:50Z","abstract_excerpt":"Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size $n^{O(1)}$ and treewidth $O(\\log^i n)$ can be simulated by a circuit of width $O(\\log^{i+1} n)$ and size $n^c$, where $c = O(1)$, if $i=0$, and $c=O(\\log \\log n)$ otherwise. For our main construction, we prove that multiplicatively disjoint arithmetic circuits of size $n^{O(1)}$ and treewidth $k$ can be simulated by bounded fan-in arithmetic formulas of depth $O(k^2\\log n)$. From this we derive the analogous statement"},"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":"0910.1427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-08T06:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"a8c2e6e58a06577cf3d00c5e6af742b7bdb5d6fed5093ac77357abbcc36668bd","abstract_canon_sha256":"bd43ff27dded0819db66834087ae48ec30d6061ac786ff45b3fc8b7330f99783"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:25.629468Z","signature_b64":"vGRx7MP6AXVD6eRm76//cWVzeU1wvN1lSblozjnrfYhPr+bsZ5StBFeQC8afpzw5eP8Tj9BRI9bCNAkZwP+hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8da014b96d75c4a7a86ae269f3ff3b5a1b7a1b63d42d44c9a09a2ef92ca10979","last_reissued_at":"2026-05-18T02:11:25.628855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:25.628855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing Bounded Treewidth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma M.N, Maurice Jansen","submitted_at":"2009-10-08T06:56:50Z","abstract_excerpt":"Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size $n^{O(1)}$ and treewidth $O(\\log^i n)$ can be simulated by a circuit of width $O(\\log^{i+1} n)$ and size $n^c$, where $c = O(1)$, if $i=0$, and $c=O(\\log \\log n)$ otherwise. For our main construction, we prove that multiplicatively disjoint arithmetic circuits of size $n^{O(1)}$ and treewidth $k$ can be simulated by bounded fan-in arithmetic formulas of depth $O(k^2\\log n)$. From this we derive the analogous statement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1427","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":"0910.1427","created_at":"2026-05-18T02:11:25.628939+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1427v1","created_at":"2026-05-18T02:11:25.628939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1427","created_at":"2026-05-18T02:11:25.628939+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWQBJOLNOXCK","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWQBJOLNOXCKPKDK","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWQBJOLN","created_at":"2026-05-18T12:26:01.383474+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/RWQBJOLNOXCKPKDK4JU7H7Z3LI","json":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI.json","graph_json":"https://pith.science/api/pith-number/RWQBJOLNOXCKPKDK4JU7H7Z3LI/graph.json","events_json":"https://pith.science/api/pith-number/RWQBJOLNOXCKPKDK4JU7H7Z3LI/events.json","paper":"https://pith.science/paper/RWQBJOLN"},"agent_actions":{"view_html":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI","download_json":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI.json","view_paper":"https://pith.science/paper/RWQBJOLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1427&json=true","fetch_graph":"https://pith.science/api/pith-number/RWQBJOLNOXCKPKDK4JU7H7Z3LI/graph.json","fetch_events":"https://pith.science/api/pith-number/RWQBJOLNOXCKPKDK4JU7H7Z3LI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI/action/storage_attestation","attest_author":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI/action/author_attestation","sign_citation":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI/action/citation_signature","submit_replication":"https://pith.science/pith/RWQBJOLNOXCKPKDK4JU7H7Z3LI/action/replication_record"}},"created_at":"2026-05-18T02:11:25.628939+00:00","updated_at":"2026-05-18T02:11:25.628939+00:00"}