{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HFFU6LAZVSMELGYSRV36SAEZSO","short_pith_number":"pith:HFFU6LAZ","schema_version":"1.0","canonical_sha256":"394b4f2c19ac98459b128d77e9009993aec0a2286004a8dda8a216afb609464e","source":{"kind":"arxiv","id":"1112.6265","version":2},"attestation_state":"computed","paper":{"title":"Short Proofs for the Determinant Identities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret, Pavel Hrubes","submitted_at":"2011-12-29T10:18:16Z","abstract_excerpt":"We study arithmetic proof systems P_c(F) and P_f(F) operating with arithmetic circuits and arithmetic formulas, respectively, that prove polynomial identities over a field F. We establish a series of structural theorems about these proof systems, the main one stating that P_c(F) proofs can be balanced: if a polynomial identity of syntactic degree d and depth k has a P_c(F) proof of size s, then it also has a P_c(F) proof of size poly(s,d) and depth O(k+\\log^2 d + \\log d\\cd \\log s). As a corollary, we obtain a quasipolynomial simulation of P_c(F) by P_f(F), for identities of a polynomial syntac"},"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":"1112.6265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-29T10:18:16Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"83b969aae3ad2a4e520e61f9a7684173b62e784e3b9fd579b47fa849ae545510","abstract_canon_sha256":"e9205ec414ad90e4166192e1a7278a1804f200da42a60c293e959bcd14ba44f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.989854Z","signature_b64":"gegTnUhFnta18IZwCfZtSLHvq6VVeZHX5T5jEtuazWTSoOXn6B/jEgp3sIh+aI7HQVGhBQqm1fzUDZRxdQFUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394b4f2c19ac98459b128d77e9009993aec0a2286004a8dda8a216afb609464e","last_reissued_at":"2026-05-18T03:27:32.989398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.989398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Proofs for the Determinant Identities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret, Pavel Hrubes","submitted_at":"2011-12-29T10:18:16Z","abstract_excerpt":"We study arithmetic proof systems P_c(F) and P_f(F) operating with arithmetic circuits and arithmetic formulas, respectively, that prove polynomial identities over a field F. We establish a series of structural theorems about these proof systems, the main one stating that P_c(F) proofs can be balanced: if a polynomial identity of syntactic degree d and depth k has a P_c(F) proof of size s, then it also has a P_c(F) proof of size poly(s,d) and depth O(k+\\log^2 d + \\log d\\cd \\log s). As a corollary, we obtain a quasipolynomial simulation of P_c(F) by P_f(F), for identities of a polynomial syntac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6265","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":"1112.6265","created_at":"2026-05-18T03:27:32.989464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6265v2","created_at":"2026-05-18T03:27:32.989464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6265","created_at":"2026-05-18T03:27:32.989464+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFFU6LAZVSME","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFFU6LAZVSMELGYS","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFFU6LAZ","created_at":"2026-05-18T12:26:30.835961+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/HFFU6LAZVSMELGYSRV36SAEZSO","json":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO.json","graph_json":"https://pith.science/api/pith-number/HFFU6LAZVSMELGYSRV36SAEZSO/graph.json","events_json":"https://pith.science/api/pith-number/HFFU6LAZVSMELGYSRV36SAEZSO/events.json","paper":"https://pith.science/paper/HFFU6LAZ"},"agent_actions":{"view_html":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO","download_json":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO.json","view_paper":"https://pith.science/paper/HFFU6LAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6265&json=true","fetch_graph":"https://pith.science/api/pith-number/HFFU6LAZVSMELGYSRV36SAEZSO/graph.json","fetch_events":"https://pith.science/api/pith-number/HFFU6LAZVSMELGYSRV36SAEZSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO/action/storage_attestation","attest_author":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO/action/author_attestation","sign_citation":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO/action/citation_signature","submit_replication":"https://pith.science/pith/HFFU6LAZVSMELGYSRV36SAEZSO/action/replication_record"}},"created_at":"2026-05-18T03:27:32.989464+00:00","updated_at":"2026-05-18T03:27:32.989464+00:00"}