{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CHVXX7ASFVEGKWSHB5OGGIEROU","short_pith_number":"pith:CHVXX7AS","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"},"canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","source":{"kind":"arxiv","id":"1312.6242","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6242","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6242v4","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6242","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"CHVXX7ASFVEG","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CHVXX7ASFVEGKWSH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CHVXX7AS","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CHVXX7ASFVEGKWSHB5OGGIEROU","target":"record","payload":{"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"},"canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","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"},"source_kind":"arxiv","source_id":"1312.6242","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9iwyvQGo2JKDLa+cO1Qig1mPxOnbRd6OZ1hysQneCDmeakAMPsBz3F8TZ1pXvRN1FgE1GyzGXA85E54jdXqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:37:55.264041Z"},"content_sha256":"b70b39287447b37d15f2bd169a8b365905e43baba818e916d8c079e1118d0ef0","schema_version":"1.0","event_id":"sha256:b70b39287447b37d15f2bd169a8b365905e43baba818e916d8c079e1118d0ef0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CHVXX7ASFVEGKWSHB5OGGIEROU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hudkPCUL6DBkJ8/jp3BHXGGH6ULmhM8aVhjjU+M8SxVFhRsxXMEFAJVjqseTxQO40TN/KJG1KqIt1EZ9C+GtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:37:55.264699Z"},"content_sha256":"f425c8dbd22376df5e7b954ed68b9e159e28c19bccc1df34c04948f67e52556c","schema_version":"1.0","event_id":"sha256:f425c8dbd22376df5e7b954ed68b9e159e28c19bccc1df34c04948f67e52556c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/bundle.json","state_url":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T20:37:55Z","links":{"resolver":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU","bundle":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/bundle.json","state":"https://pith.science/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHVXX7ASFVEGKWSHB5OGGIEROU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CHVXX7ASFVEGKWSHB5OGGIEROU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa13187657cdcfc8c52eb1331ab48db256e43d2703814b77397b239cad54739f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-21T11:32:41Z","title_canon_sha256":"3f0a56525da06751c6cd2299c8c4bb3914d751aa34685df88e24ac6b44b578b1"},"schema_version":"1.0","source":{"id":"1312.6242","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6242","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6242v4","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6242","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"CHVXX7ASFVEG","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CHVXX7ASFVEGKWSH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CHVXX7AS","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:f425c8dbd22376df5e7b954ed68b9e159e28c19bccc1df34c04948f67e52556c","target":"graph","created_at":"2026-05-18T02:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Fu Li, Iddo Tzameret","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-21T11:32:41Z","title":"Generating Matrix Identities and Proof Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6242","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b70b39287447b37d15f2bd169a8b365905e43baba818e916d8c079e1118d0ef0","target":"record","created_at":"2026-05-18T02:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa13187657cdcfc8c52eb1331ab48db256e43d2703814b77397b239cad54739f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-21T11:32:41Z","title_canon_sha256":"3f0a56525da06751c6cd2299c8c4bb3914d751aa34685df88e24ac6b44b578b1"},"schema_version":"1.0","source":{"id":"1312.6242","kind":"arxiv","version":4}},"canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11eb7bfc122d48655a470f5c632091751437ced85935a1d422bf322c2e9ef509","first_computed_at":"2026-05-18T02:43:45.406243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:45.406243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2py+dOSZFmWxYm8UVndnxrODvbf8NrVikxxyVM4k4xHmQXzL8y/IADgnI75YxhmK4wtHhjesavO3sfYA4ywhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:45.406725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6242","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b70b39287447b37d15f2bd169a8b365905e43baba818e916d8c079e1118d0ef0","sha256:f425c8dbd22376df5e7b954ed68b9e159e28c19bccc1df34c04948f67e52556c"],"state_sha256":"ed20b6c19e4ad7e8bb279ccf86f0cfe4f90d9eb574c25ffc0ab14c92a65c86ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtucwgNSFsGSuxvzWoHO56Tx+cXAOQprV3rk+dxF4AiZnC7/S43iHc+oAP/7HZB/eI9vQKwifCT3rbqKeMfoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:37:55.268136Z","bundle_sha256":"c19d9b4f3276131e1bcb40b32eb3e4d54ea27815fa8fe706da3bfabf17c086bd"}}