{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FEIO2FGKG44TONHCLO2ABTHOBZ","short_pith_number":"pith:FEIO2FGK","schema_version":"1.0","canonical_sha256":"2910ed14ca37393734e25bb400ccee0e6ca7fcb5e52384beed7658f2f5083621","source":{"kind":"arxiv","id":"1907.05589","version":1},"attestation_state":"computed","paper":{"title":"Optimally Perturbed Identity Matrices of Rank 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Robi Bhattacharjee","submitted_at":"2019-07-12T06:20:42Z","abstract_excerpt":"The problem of optimal antipodal codes can be framed as finding low rank Gram matrices $G$ with $G_{ii} = 1$ and $|G_{ij}| \\leq \\epsilon$ for $1 \\leq i \\neq j \\leq n$. In 2018, Bukh and Cox introduced a new bounding technique by removing the condition that $G$ be a gram matrix. In this work, we investigate how tight this relaxation is, and find exact results for real valued matrices of rank $2$."},"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":"1907.05589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-12T06:20:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"91a7ba285e122d31e94f800fbd21e5f51f2fbd72ada95358f8f984b174d934b7","abstract_canon_sha256":"e0efd955039fa31dc9d6b35171463ca5ae39ccc2e0ec590b9d2dcc8bd4c09044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:47.756124Z","signature_b64":"aMpzdVXfUiY58SxZNTeGR/U9Nm6NlEiapIoE6lZetA9ozVLrymIilBFNwDLRxIwe8ylcd5EW3aP1jpnuEDm6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2910ed14ca37393734e25bb400ccee0e6ca7fcb5e52384beed7658f2f5083621","last_reissued_at":"2026-05-17T23:40:47.755402Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:47.755402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Perturbed Identity Matrices of Rank 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Robi Bhattacharjee","submitted_at":"2019-07-12T06:20:42Z","abstract_excerpt":"The problem of optimal antipodal codes can be framed as finding low rank Gram matrices $G$ with $G_{ii} = 1$ and $|G_{ij}| \\leq \\epsilon$ for $1 \\leq i \\neq j \\leq n$. In 2018, Bukh and Cox introduced a new bounding technique by removing the condition that $G$ be a gram matrix. In this work, we investigate how tight this relaxation is, and find exact results for real valued matrices of rank $2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05589","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.05589","created_at":"2026-05-17T23:40:47.755518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05589v1","created_at":"2026-05-17T23:40:47.755518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05589","created_at":"2026-05-17T23:40:47.755518+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEIO2FGKG44T","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEIO2FGKG44TONHC","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEIO2FGK","created_at":"2026-05-18T12:33:15.570797+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/FEIO2FGKG44TONHCLO2ABTHOBZ","json":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ.json","graph_json":"https://pith.science/api/pith-number/FEIO2FGKG44TONHCLO2ABTHOBZ/graph.json","events_json":"https://pith.science/api/pith-number/FEIO2FGKG44TONHCLO2ABTHOBZ/events.json","paper":"https://pith.science/paper/FEIO2FGK"},"agent_actions":{"view_html":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ","download_json":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ.json","view_paper":"https://pith.science/paper/FEIO2FGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05589&json=true","fetch_graph":"https://pith.science/api/pith-number/FEIO2FGKG44TONHCLO2ABTHOBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FEIO2FGKG44TONHCLO2ABTHOBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ/action/storage_attestation","attest_author":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ/action/author_attestation","sign_citation":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ/action/citation_signature","submit_replication":"https://pith.science/pith/FEIO2FGKG44TONHCLO2ABTHOBZ/action/replication_record"}},"created_at":"2026-05-17T23:40:47.755518+00:00","updated_at":"2026-05-17T23:40:47.755518+00:00"}