{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SGJFAWTAS5VOGQO4TK2QGFXQFY","short_pith_number":"pith:SGJFAWTA","canonical_record":{"source":{"id":"1708.01646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-04T19:23:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f207057198dc1f3ddb2991159e04d692fa4683c83f639f13ba7058e23ae18c31","abstract_canon_sha256":"28e5061aa79ff4111db7af41edb590f5cf97ca5adb315590f6886e7320143ffa"},"schema_version":"1.0"},"canonical_sha256":"9192505a60976ae341dc9ab50316f02e36e90b1022aa3b7cc9eb7f5c986c8695","source":{"kind":"arxiv","id":"1708.01646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01646","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01646v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01646","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"SGJFAWTAS5VO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGJFAWTAS5VOGQO4","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGJFAWTA","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SGJFAWTAS5VOGQO4TK2QGFXQFY","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-04T19:23:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f207057198dc1f3ddb2991159e04d692fa4683c83f639f13ba7058e23ae18c31","abstract_canon_sha256":"28e5061aa79ff4111db7af41edb590f5cf97ca5adb315590f6886e7320143ffa"},"schema_version":"1.0"},"canonical_sha256":"9192505a60976ae341dc9ab50316f02e36e90b1022aa3b7cc9eb7f5c986c8695","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.322656Z","signature_b64":"tTAQ1Rf6J3k5qvLLmESuuCqvYbQqIGAdOHrg8kuxhrWZSURMOWtXQG/tZ2vGh/vA1FuIbqynCMkRwZqUy1P/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9192505a60976ae341dc9ab50316f02e36e90b1022aa3b7cc9eb7f5c986c8695","last_reissued_at":"2026-05-18T00:38:35.322177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.322177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01646","source_version":1,"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9s8LB8rRXRa3KdbxCYPhe/sJOnG7I/Qg33JprBr1T0LISgy0nKBRQ7HbFUq6Uv4WlAtIYr3ADkC56jPQHGABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:32:19.335366Z"},"content_sha256":"5529fa08fe0ed8fd43a2c5e340ec301e4fa67ca2847ade9ae24d4c50835b9a3d","schema_version":"1.0","event_id":"sha256:5529fa08fe0ed8fd43a2c5e340ec301e4fa67ca2847ade9ae24d4c50835b9a3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SGJFAWTAS5VOGQO4TK2QGFXQFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix rigidity and the Croot-Lev-Pach lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Benjamin Edelman, Zeev Dvir","submitted_at":"2017-08-04T19:23:31Z","abstract_excerpt":"Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid enough to carry out Valiant's plan has been found. Recently, Alman and Williams showed, contrary to common belief, that the $2^n \\times 2^n$ Hadamard matrix could not be used for Valiant's program as it is not sufficiently rigid. In this note we observe a similar `non rigidity' phenomena for any $q^n \\times q^n$ matrix $M$ of the form $M(x,y) = f(x+y)$, where $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01646","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"},"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OACLHHKZy2QZT8OTB8mATVw7L6J2dpYKOZtJ0xZG3AMOkhtcqzKOtvLGv64ijlzBKNRKSY+OxXbh9DTOUoHMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:32:19.336121Z"},"content_sha256":"b11081fa5dabf91f99844e09d62c7c995a7ef8e059e25d12ca13740ae19fd7fa","schema_version":"1.0","event_id":"sha256:b11081fa5dabf91f99844e09d62c7c995a7ef8e059e25d12ca13740ae19fd7fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/bundle.json","state_url":"https://pith.science/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/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-06-09T11:32:19Z","links":{"resolver":"https://pith.science/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY","bundle":"https://pith.science/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/bundle.json","state":"https://pith.science/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGJFAWTAS5VOGQO4TK2QGFXQFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SGJFAWTAS5VOGQO4TK2QGFXQFY","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":"28e5061aa79ff4111db7af41edb590f5cf97ca5adb315590f6886e7320143ffa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-04T19:23:31Z","title_canon_sha256":"f207057198dc1f3ddb2991159e04d692fa4683c83f639f13ba7058e23ae18c31"},"schema_version":"1.0","source":{"id":"1708.01646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01646","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01646v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01646","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"SGJFAWTAS5VO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGJFAWTAS5VOGQO4","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGJFAWTA","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:b11081fa5dabf91f99844e09d62c7c995a7ef8e059e25d12ca13740ae19fd7fa","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid enough to carry out Valiant's plan has been found. Recently, Alman and Williams showed, contrary to common belief, that the $2^n \\times 2^n$ Hadamard matrix could not be used for Valiant's program as it is not sufficiently rigid. In this note we observe a similar `non rigidity' phenomena for any $q^n \\times q^n$ matrix $M$ of the form $M(x,y) = f(x+y)$, where $","authors_text":"Benjamin Edelman, Zeev Dvir","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-04T19:23:31Z","title":"Matrix rigidity and the Croot-Lev-Pach lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01646","kind":"arxiv","version":1},"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:5529fa08fe0ed8fd43a2c5e340ec301e4fa67ca2847ade9ae24d4c50835b9a3d","target":"record","created_at":"2026-05-18T00:38:35Z","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":"28e5061aa79ff4111db7af41edb590f5cf97ca5adb315590f6886e7320143ffa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-04T19:23:31Z","title_canon_sha256":"f207057198dc1f3ddb2991159e04d692fa4683c83f639f13ba7058e23ae18c31"},"schema_version":"1.0","source":{"id":"1708.01646","kind":"arxiv","version":1}},"canonical_sha256":"9192505a60976ae341dc9ab50316f02e36e90b1022aa3b7cc9eb7f5c986c8695","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9192505a60976ae341dc9ab50316f02e36e90b1022aa3b7cc9eb7f5c986c8695","first_computed_at":"2026-05-18T00:38:35.322177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.322177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTAQ1Rf6J3k5qvLLmESuuCqvYbQqIGAdOHrg8kuxhrWZSURMOWtXQG/tZ2vGh/vA1FuIbqynCMkRwZqUy1P/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.322656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5529fa08fe0ed8fd43a2c5e340ec301e4fa67ca2847ade9ae24d4c50835b9a3d","sha256:b11081fa5dabf91f99844e09d62c7c995a7ef8e059e25d12ca13740ae19fd7fa"],"state_sha256":"9d01f66913aa2f72e6e0a8a5c04d71c5496bc5da13d20b4a6fa46fad933aee91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4azF3rK9564uZ0IHcz1tMUfdVE0Yiwrck9tigc5bpaBV0NKryxX2mWh92Ti2hZ8m5XDk2uu4PRrGxQrP1Jg4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:32:19.340641Z","bundle_sha256":"4ec808c869867e677f383d640bee176660af99830354b6978f37c997e6b1aa78"}}