{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:ZUZKCTXEI2CEFGVPGHZK4VZTST","short_pith_number":"pith:ZUZKCTXE","schema_version":"1.0","canonical_sha256":"cd32a14ee44684429aaf31f2ae573394e40a1d5777efec3b1cb24099e604bf26","source":{"kind":"arxiv","id":"math/0304410","version":1},"attestation_state":"computed","paper":{"title":"New lower bounds for the maximal determinant problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Solomon, Roland Dowdeswell, Warren D. Smith, William P. Orrick","submitted_at":"2003-04-25T16:13:59Z","abstract_excerpt":"We report new world records for the maximal determinant of an n-by-n matrix with entries +/-1. Using various techniques, we beat existing records for n=22, 23, 27, 29, 31, 33, 34, 35, 39, 45, 47, 53, 63, 69, 73, 77, 79, 93, and 95, and we present the record-breaking matrices here. We conjecture that our n=22 value attains the globally maximizing determinant in its dimension. We also tabulate new records for n=67, 75, 83, 87, 91 and 99, dimensions for which no previous claims have been made. The relevant matrices in all these dimensions, along with other pertinent information, are posted at htt"},"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":"math/0304410","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-04-25T16:13:59Z","cross_cats_sorted":[],"title_canon_sha256":"3fb2ec2803fa4d80d9775d9fe720be5526500c0a7fea00d4b541d605e5f53389","abstract_canon_sha256":"7def453038b20e48c6e6506aefcf0e251d02f84334411645830a722a77bef881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:37:15.582015Z","signature_b64":"bI1BwNpJHnpBimIPvSKFNf7w5r9SkahCW89P8B8sWuIjY7mJLkfmFifTWwlKeX6Sw8KGEKmDnvFh+NRby9FXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd32a14ee44684429aaf31f2ae573394e40a1d5777efec3b1cb24099e604bf26","last_reissued_at":"2026-07-04T14:37:15.581498Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:37:15.581498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New lower bounds for the maximal determinant problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Solomon, Roland Dowdeswell, Warren D. Smith, William P. Orrick","submitted_at":"2003-04-25T16:13:59Z","abstract_excerpt":"We report new world records for the maximal determinant of an n-by-n matrix with entries +/-1. Using various techniques, we beat existing records for n=22, 23, 27, 29, 31, 33, 34, 35, 39, 45, 47, 53, 63, 69, 73, 77, 79, 93, and 95, and we present the record-breaking matrices here. We conjecture that our n=22 value attains the globally maximizing determinant in its dimension. We also tabulate new records for n=67, 75, 83, 87, 91 and 99, dimensions for which no previous claims have been made. The relevant matrices in all these dimensions, along with other pertinent information, are posted at htt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0304410","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0304410/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0304410","created_at":"2026-07-04T14:37:15.581569+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0304410v1","created_at":"2026-07-04T14:37:15.581569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0304410","created_at":"2026-07-04T14:37:15.581569+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUZKCTXEI2CE","created_at":"2026-07-04T14:37:15.581569+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUZKCTXEI2CEFGVP","created_at":"2026-07-04T14:37:15.581569+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUZKCTXE","created_at":"2026-07-04T14:37:15.581569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.23473","citing_title":"ThetaEvolve: Test-time Learning on Open Problems","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19341","citing_title":"Evaluation-driven Scaling for Scientific Discovery","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST","json":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST.json","graph_json":"https://pith.science/api/pith-number/ZUZKCTXEI2CEFGVPGHZK4VZTST/graph.json","events_json":"https://pith.science/api/pith-number/ZUZKCTXEI2CEFGVPGHZK4VZTST/events.json","paper":"https://pith.science/paper/ZUZKCTXE"},"agent_actions":{"view_html":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST","download_json":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST.json","view_paper":"https://pith.science/paper/ZUZKCTXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0304410&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUZKCTXEI2CEFGVPGHZK4VZTST/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUZKCTXEI2CEFGVPGHZK4VZTST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST/action/storage_attestation","attest_author":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST/action/author_attestation","sign_citation":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST/action/citation_signature","submit_replication":"https://pith.science/pith/ZUZKCTXEI2CEFGVPGHZK4VZTST/action/replication_record"}},"created_at":"2026-07-04T14:37:15.581569+00:00","updated_at":"2026-07-04T14:37:15.581569+00:00"}