{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:S4H45WGU77EJ6DSARBGHVPRQA3","short_pith_number":"pith:S4H45WGU","canonical_record":{"source":{"id":"1402.6817","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T08:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"a60a25aa809cf7e40162b7ba44183e68524245b83d119eb7ea5a6f43123c8501","abstract_canon_sha256":"a76bfacb266c8f610abb1541859ca08cf910c1ba144b1d6b14fd3a4bee56c40a"},"schema_version":"1.0"},"canonical_sha256":"970fced8d4ffc89f0e40884c7abe3006e1117422b8049ecc574b375f7cdbe2fd","source":{"kind":"arxiv","id":"1402.6817","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6817","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6817v6","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6817","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"S4H45WGU77EJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"S4H45WGU77EJ6DSA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"S4H45WGU","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:S4H45WGU77EJ6DSARBGHVPRQA3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6817","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T08:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"a60a25aa809cf7e40162b7ba44183e68524245b83d119eb7ea5a6f43123c8501","abstract_canon_sha256":"a76bfacb266c8f610abb1541859ca08cf910c1ba144b1d6b14fd3a4bee56c40a"},"schema_version":"1.0"},"canonical_sha256":"970fced8d4ffc89f0e40884c7abe3006e1117422b8049ecc574b375f7cdbe2fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:29.535958Z","signature_b64":"v3uzdDKhTny2qnsWoMYCRvxk6nsfhNWvAo0CdW3E5yyKobQYmcj8bJsL7z23ulNu1XOHOMw9x46Jt+I1DNOTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970fced8d4ffc89f0e40884c7abe3006e1117422b8049ecc574b375f7cdbe2fd","last_reissued_at":"2026-05-18T01:01:29.535398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:29.535398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6817","source_version":6,"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-18T01:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blklzQxSjXbWeS7CUBGL7awonOy+hi06cWmCZ5nSyLaXojfztr3rH5Uczlwt+96P5NuxZl2b7heED1K+6+IJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:42:28.780400Z"},"content_sha256":"dbbc41a7982eddf13aa2f22e31ba580ce50224221856f0d21b9e9be9ae207e3c","schema_version":"1.0","event_id":"sha256:dbbc41a7982eddf13aa2f22e31ba580ce50224221856f0d21b9e9be9ae207e3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:S4H45WGU77EJ6DSARBGHVPRQA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on maximal determinants of binary matrices via the probabilistic method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Judy-anne H. Osborn, Richard P. Brent, Warren D. Smith","submitted_at":"2014-02-27T08:03:41Z","abstract_excerpt":"Let $D(n)$ be the maximal determinant for $n \\times n$ $\\{\\pm 1\\}$-matrices, and ${\\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\\mathcal R}(n)$ in terms of $d$, where $n = h+d$, $h$ is the order of a Hadamard matrix, and $h$ is maximal subject to $h \\le n$. A relatively simple bound is \\[{\\mathcal R}(n) \\ge \\left(\\frac{2}{\\pi e}\\right)^{d/2}\n  \\left(1 - d^2\\left(\\frac{\\pi}{2h}\\right)^{1/2}\\right)\n  \\;\\text{ for all }\\; n \\ge 1.\\] An asymptotically sharper bound is \\[{\\mathcal R}(n) \\ge \\left(\\frac{2}{\\pi e}\\right)^{d/2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6817","kind":"arxiv","version":6},"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-18T01:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NuMWcIMTD6U6ugGXTwri+mk39ieuH2g/Z1J+N57OIL+CETuS38PQ0NCMx/198d/vmasrJnh5wBfPf6Z11B8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:42:28.780750Z"},"content_sha256":"d9660f072588e3be143872bd080fb97c28b786a2ac096ba47bb05e108af71d22","schema_version":"1.0","event_id":"sha256:d9660f072588e3be143872bd080fb97c28b786a2ac096ba47bb05e108af71d22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4H45WGU77EJ6DSARBGHVPRQA3/bundle.json","state_url":"https://pith.science/pith/S4H45WGU77EJ6DSARBGHVPRQA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4H45WGU77EJ6DSARBGHVPRQA3/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-31T04:42:28Z","links":{"resolver":"https://pith.science/pith/S4H45WGU77EJ6DSARBGHVPRQA3","bundle":"https://pith.science/pith/S4H45WGU77EJ6DSARBGHVPRQA3/bundle.json","state":"https://pith.science/pith/S4H45WGU77EJ6DSARBGHVPRQA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4H45WGU77EJ6DSARBGHVPRQA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:S4H45WGU77EJ6DSARBGHVPRQA3","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":"a76bfacb266c8f610abb1541859ca08cf910c1ba144b1d6b14fd3a4bee56c40a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T08:03:41Z","title_canon_sha256":"a60a25aa809cf7e40162b7ba44183e68524245b83d119eb7ea5a6f43123c8501"},"schema_version":"1.0","source":{"id":"1402.6817","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6817","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6817v6","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6817","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"S4H45WGU77EJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"S4H45WGU77EJ6DSA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"S4H45WGU","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d9660f072588e3be143872bd080fb97c28b786a2ac096ba47bb05e108af71d22","target":"graph","created_at":"2026-05-18T01:01:29Z","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":"Let $D(n)$ be the maximal determinant for $n \\times n$ $\\{\\pm 1\\}$-matrices, and ${\\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\\mathcal R}(n)$ in terms of $d$, where $n = h+d$, $h$ is the order of a Hadamard matrix, and $h$ is maximal subject to $h \\le n$. A relatively simple bound is \\[{\\mathcal R}(n) \\ge \\left(\\frac{2}{\\pi e}\\right)^{d/2}\n  \\left(1 - d^2\\left(\\frac{\\pi}{2h}\\right)^{1/2}\\right)\n  \\;\\text{ for all }\\; n \\ge 1.\\] An asymptotically sharper bound is \\[{\\mathcal R}(n) \\ge \\left(\\frac{2}{\\pi e}\\right)^{d/2","authors_text":"Judy-anne H. Osborn, Richard P. Brent, Warren D. Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T08:03:41Z","title":"Lower bounds on maximal determinants of binary matrices via the probabilistic method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6817","kind":"arxiv","version":6},"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:dbbc41a7982eddf13aa2f22e31ba580ce50224221856f0d21b9e9be9ae207e3c","target":"record","created_at":"2026-05-18T01:01:29Z","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":"a76bfacb266c8f610abb1541859ca08cf910c1ba144b1d6b14fd3a4bee56c40a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T08:03:41Z","title_canon_sha256":"a60a25aa809cf7e40162b7ba44183e68524245b83d119eb7ea5a6f43123c8501"},"schema_version":"1.0","source":{"id":"1402.6817","kind":"arxiv","version":6}},"canonical_sha256":"970fced8d4ffc89f0e40884c7abe3006e1117422b8049ecc574b375f7cdbe2fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970fced8d4ffc89f0e40884c7abe3006e1117422b8049ecc574b375f7cdbe2fd","first_computed_at":"2026-05-18T01:01:29.535398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:29.535398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v3uzdDKhTny2qnsWoMYCRvxk6nsfhNWvAo0CdW3E5yyKobQYmcj8bJsL7z23ulNu1XOHOMw9x46Jt+I1DNOTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:29.535958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6817","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbbc41a7982eddf13aa2f22e31ba580ce50224221856f0d21b9e9be9ae207e3c","sha256:d9660f072588e3be143872bd080fb97c28b786a2ac096ba47bb05e108af71d22"],"state_sha256":"988bb015b6bba83cafa3acd39175ba877cd8ce58365d8d6b80f928a0721120f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onBfMq7AReOFUgVQn7QqqaIgySwGspfWFUHdeDTvgeUOv5ljNavXrAgehZDoNrqsxUaDYaYKIHtHpaVfMTBcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:42:28.782760Z","bundle_sha256":"2124b7676fdefbd0f952956c2de7a9d5b135f9ac40429ab41a660f3255e1d6d5"}}