{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:B3VMS2GJG4DRYQTNUNEXD6JU7X","short_pith_number":"pith:B3VMS2GJ","canonical_record":{"source":{"id":"0910.5301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-28T07:56:23Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"ef5a220700ea2124ae9d30a7bfa99ac66bafa9d1d431c1d6ae633e3e5207b2d7","abstract_canon_sha256":"dd1bfbab4b8175b01dd21ca121c3c2e1ec558aed569a2d688224ce98f814889b"},"schema_version":"1.0"},"canonical_sha256":"0eeac968c937071c426da34971f934fddbab3fddf5e78fdbac1dbeac75b4984c","source":{"kind":"arxiv","id":"0910.5301","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5301","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5301v3","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5301","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"B3VMS2GJG4DR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"B3VMS2GJG4DRYQTN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"B3VMS2GJ","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:B3VMS2GJG4DRYQTNUNEXD6JU7X","target":"record","payload":{"canonical_record":{"source":{"id":"0910.5301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-28T07:56:23Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"ef5a220700ea2124ae9d30a7bfa99ac66bafa9d1d431c1d6ae633e3e5207b2d7","abstract_canon_sha256":"dd1bfbab4b8175b01dd21ca121c3c2e1ec558aed569a2d688224ce98f814889b"},"schema_version":"1.0"},"canonical_sha256":"0eeac968c937071c426da34971f934fddbab3fddf5e78fdbac1dbeac75b4984c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.635149Z","signature_b64":"PQNYNspnxUSKDSQUsPIjroNn+KgDOd2B3b6l4Yx2zaNHTs+MOu0biC18yhD/0acMPO8HG0QX761g3LwGpPdXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eeac968c937071c426da34971f934fddbab3fddf5e78fdbac1dbeac75b4984c","last_reissued_at":"2026-05-18T02:28:48.634691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.634691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.5301","source_version":3,"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:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fO1oRDj0yNwbL/vV1YEEFOMgIWptEO8NQWSM+J8SZW81Hp+JDjoPXwqfj1KdMM99QnN3L6jNnOdDrgDOroj+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:04:10.010540Z"},"content_sha256":"ec89a35b0b139750ef7dcdec05f208a59c4b156f1ffa815bfdf85471b30429f4","schema_version":"1.0","event_id":"sha256:ec89a35b0b139750ef7dcdec05f208a59c4b156f1ffa815bfdf85471b30429f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:B3VMS2GJG4DRYQTNUNEXD6JU7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Elimination Theory to construct Rigid Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Abhinav Kumar, Jayalal Sarma M. N, Satyanarayana V. Lokam, Vijay M. Patankar","submitted_at":"2009-10-28T07:56:23Z","abstract_excerpt":"The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar rank-robustness functions of matrices have found numerous applications in circuit complexity, communication complexity, and learning complexity. Almost all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a long-standing open question to construct infinite families of explicit matrices even with superlinear rigidity when r = Omega(n).\n  In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5301","kind":"arxiv","version":3},"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:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+WaDTnw+PbPBbit+y5kwYKCKzUmzm3HexevryPLHFIeFI2O9NSvQO6JTfVEMc9jsyXckCajUo13nW88PKy/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:04:10.011179Z"},"content_sha256":"199d915930b2dd1b81920c74da268bd083ca8a8a09a34e760c2f3e4b556b6daa","schema_version":"1.0","event_id":"sha256:199d915930b2dd1b81920c74da268bd083ca8a8a09a34e760c2f3e4b556b6daa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/bundle.json","state_url":"https://pith.science/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/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-08T18:04:10Z","links":{"resolver":"https://pith.science/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X","bundle":"https://pith.science/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/bundle.json","state":"https://pith.science/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3VMS2GJG4DRYQTNUNEXD6JU7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:B3VMS2GJG4DRYQTNUNEXD6JU7X","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":"dd1bfbab4b8175b01dd21ca121c3c2e1ec558aed569a2d688224ce98f814889b","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-28T07:56:23Z","title_canon_sha256":"ef5a220700ea2124ae9d30a7bfa99ac66bafa9d1d431c1d6ae633e3e5207b2d7"},"schema_version":"1.0","source":{"id":"0910.5301","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5301","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5301v3","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5301","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"B3VMS2GJG4DR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"B3VMS2GJG4DRYQTN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"B3VMS2GJ","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:199d915930b2dd1b81920c74da268bd083ca8a8a09a34e760c2f3e4b556b6daa","target":"graph","created_at":"2026-05-18T02:28:48Z","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":"The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar rank-robustness functions of matrices have found numerous applications in circuit complexity, communication complexity, and learning complexity. Almost all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a long-standing open question to construct infinite families of explicit matrices even with superlinear rigidity when r = Omega(n).\n  In this paper","authors_text":"Abhinav Kumar, Jayalal Sarma M. N, Satyanarayana V. Lokam, Vijay M. Patankar","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-28T07:56:23Z","title":"Using Elimination Theory to construct Rigid Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5301","kind":"arxiv","version":3},"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:ec89a35b0b139750ef7dcdec05f208a59c4b156f1ffa815bfdf85471b30429f4","target":"record","created_at":"2026-05-18T02:28:48Z","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":"dd1bfbab4b8175b01dd21ca121c3c2e1ec558aed569a2d688224ce98f814889b","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-28T07:56:23Z","title_canon_sha256":"ef5a220700ea2124ae9d30a7bfa99ac66bafa9d1d431c1d6ae633e3e5207b2d7"},"schema_version":"1.0","source":{"id":"0910.5301","kind":"arxiv","version":3}},"canonical_sha256":"0eeac968c937071c426da34971f934fddbab3fddf5e78fdbac1dbeac75b4984c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eeac968c937071c426da34971f934fddbab3fddf5e78fdbac1dbeac75b4984c","first_computed_at":"2026-05-18T02:28:48.634691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:48.634691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PQNYNspnxUSKDSQUsPIjroNn+KgDOd2B3b6l4Yx2zaNHTs+MOu0biC18yhD/0acMPO8HG0QX761g3LwGpPdXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:48.635149Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.5301","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec89a35b0b139750ef7dcdec05f208a59c4b156f1ffa815bfdf85471b30429f4","sha256:199d915930b2dd1b81920c74da268bd083ca8a8a09a34e760c2f3e4b556b6daa"],"state_sha256":"247cff8d4a95c6e1d262c9f5a43aee85368fa4828c9d7299bde4c13fb2df685f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGhqpo8QGYYfeOgmCfC0ZJCwPiMUHTikeUl8583vxnyP31pMrXqMJYG8UL0t4a2KbVyE9S7nu+TvvZHqMDSiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:04:10.014788Z","bundle_sha256":"0b087bcbf80851ad7532d9e3028c13011c4b84242c46e3e0e93acd03e77f48d3"}}