{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CHVXX7ASFVEGKWSHB5OGGIEROU","short_pith_number":"pith:CHVXX7AS","schema_version":"1.0","canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","source":{"kind":"arxiv","id":"1312.6242","version":4},"attestation_state":"computed","paper":{"title":"Generating Matrix Identities and Proof Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fu Li, Iddo Tzameret","submitted_at":"2013-12-21T11:32:41Z","abstract_excerpt":"Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \\times d$ matrices over a field $\\mathbb{F}$, is a non-commutative polynomial $f(x_1,\\ldots,x_n)$ over $\\mathbb{F}$ such that $f$ vanishes on every $d \\times d$ matrix assignment to its variables.\n  We focus on arithmetic proofs, which are proofs of polynomial identities operating with arithmetic circuits and whose axioms are the polynomial-ring axioms (these proofs serve as an algebraic analogue of the Extended "},"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":"1312.6242","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-21T11:32:41Z","cross_cats_sorted":[],"title_canon_sha256":"3f0a56525da06751c6cd2299c8c4bb3914d751aa34685df88e24ac6b44b578b1","abstract_canon_sha256":"aa13187657cdcfc8c52eb1331ab48db256e43d2703814b77397b239cad54739f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:45.406725Z","signature_b64":"2py+dOSZFmWxYm8UVndnxrODvbf8NrVikxxyVM4k4xHmQXzL8y/IADgnI75YxhmK4wtHhjesavO3sfYA4ywhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","last_reissued_at":"2026-05-18T02:43:45.406243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:45.406243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Matrix Identities and Proof Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fu Li, Iddo Tzameret","submitted_at":"2013-12-21T11:32:41Z","abstract_excerpt":"Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \\times d$ matrices over a field $\\mathbb{F}$, is a non-commutative polynomial $f(x_1,\\ldots,x_n)$ over $\\mathbb{F}$ such that $f$ vanishes on every $d \\times d$ matrix assignment to its variables.\n  We focus on arithmetic proofs, which are proofs of polynomial identities operating with arithmetic circuits and whose axioms are the polynomial-ring axioms (these proofs serve as an algebraic analogue of the Extended "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6242","kind":"arxiv","version":4},"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":"1312.6242","created_at":"2026-05-18T02:43:45.406328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6242v4","created_at":"2026-05-18T02:43:45.406328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6242","created_at":"2026-05-18T02:43:45.406328+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHVXX7ASFVEG","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHVXX7ASFVEGKWSH","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHVXX7AS","created_at":"2026-05-18T12:27:40.988391+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/CHVXX7ASFVEGKWSHB5OGGIEROU","json":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU.json","graph_json":"https://pith.science/api/pith-number/CHVXX7ASFVEGKWSHB5OGGIEROU/graph.json","events_json":"https://pith.science/api/pith-number/CHVXX7ASFVEGKWSHB5OGGIEROU/events.json","paper":"https://pith.science/paper/CHVXX7AS"},"agent_actions":{"view_html":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU","download_json":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU.json","view_paper":"https://pith.science/paper/CHVXX7AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6242&json=true","fetch_graph":"https://pith.science/api/pith-number/CHVXX7ASFVEGKWSHB5OGGIEROU/graph.json","fetch_events":"https://pith.science/api/pith-number/CHVXX7ASFVEGKWSHB5OGGIEROU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/action/storage_attestation","attest_author":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/action/author_attestation","sign_citation":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/action/citation_signature","submit_replication":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/action/replication_record"}},"created_at":"2026-05-18T02:43:45.406328+00:00","updated_at":"2026-05-18T02:43:45.406328+00:00"}