{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G2ZB6NKWSZD6ZA2LDLLC5T6PWL","short_pith_number":"pith:G2ZB6NKW","canonical_record":{"source":{"id":"1501.06235","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T02:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"123bcde0a19716c4f8821b4f1635ce2c1228423656da2cdbaa28e83fc2ee0e5d","abstract_canon_sha256":"7da541c847b309399e1ec5dd623614d7832fa6ee34ff58a4480e261188bfe777"},"schema_version":"1.0"},"canonical_sha256":"36b21f35569647ec834b1ad62ecfcfb2c8fe82934e3e773f1252e63ef8756b9a","source":{"kind":"arxiv","id":"1501.06235","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06235","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06235v7","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06235","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"G2ZB6NKWSZD6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G2ZB6NKWSZD6ZA2L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G2ZB6NKW","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G2ZB6NKWSZD6ZA2LDLLC5T6PWL","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06235","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T02:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"123bcde0a19716c4f8821b4f1635ce2c1228423656da2cdbaa28e83fc2ee0e5d","abstract_canon_sha256":"7da541c847b309399e1ec5dd623614d7832fa6ee34ff58a4480e261188bfe777"},"schema_version":"1.0"},"canonical_sha256":"36b21f35569647ec834b1ad62ecfcfb2c8fe82934e3e773f1252e63ef8756b9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.329496Z","signature_b64":"CZwD8yWr1aGBAeYhSCTRo/kmG4ysd5+euYxIkaA7ymxLEov78fzzy10fmc8mV2FTbcf/oJvhTvE+/WM5MT7yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b21f35569647ec834b1ad62ecfcfb2c8fe82934e3e773f1252e63ef8756b9a","last_reissued_at":"2026-05-18T01:00:46.329092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.329092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06235","source_version":7,"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:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ky5qvp8ygtExUhj6T5Hd2XftZpVTm+rRsLOTL6ajHNsuBcISWg4qn2hds/3bMTtQNA1KcOXl4NoiM7LiLX8gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:27:56.468671Z"},"content_sha256":"ec1933be3a047aba939d3cf17457c1189d22106fe40c4d593446afb925528bba","schema_version":"1.0","event_id":"sha256:ec1933be3a047aba939d3cf17457c1189d22106fe40c4d593446afb925528bba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G2ZB6NKWSZD6ZA2LDLLC5T6PWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic lower bounds on maximal determinants of binary matrices","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":"2015-01-26T02:19:57Z","abstract_excerpt":"Let ${\\mathcal D}(n)$ be the maximal determinant for $n \\times n$ $\\{\\pm 1\\}$-matrices, and $\\mathcal R(n) = {\\mathcal D}(n)/n^{n/2}$ be the ratio of ${\\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds on ${\\mathcal D}(n)$ and $\\mathcal R(n)$ in terms of $d = n-h$, where $h$ is the order of a Hadamard matrix and $h$ is maximal subject to $h \\le n$. For example, $\\mathcal R(n) > (\\pi e/2)^{-d/2}$ if $1 \\le d \\le 3$, and $\\mathcal R(n) > (\\pi e/2)^{-d/2}(1 - d^2(\\pi/(2h))^{1/2})$ if $d > 3$. By a recent result of Livinskyi, $d^2/h^{1/2} \\to 0$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06235","kind":"arxiv","version":7},"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:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQmnPuu167y2woz7pii1C/BkQlfOfK8Zual5mFgzN9iytGn8DPY9iSXmyl7RWVtLCQiblsRY6r/EDqo14YP1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:27:56.469397Z"},"content_sha256":"7555f2abab3686f32aae08d702be6cc7243f710d8b9e3469f7c3ee70d4739a7b","schema_version":"1.0","event_id":"sha256:7555f2abab3686f32aae08d702be6cc7243f710d8b9e3469f7c3ee70d4739a7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/bundle.json","state_url":"https://pith.science/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/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-30T22:27:56Z","links":{"resolver":"https://pith.science/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL","bundle":"https://pith.science/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/bundle.json","state":"https://pith.science/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2ZB6NKWSZD6ZA2LDLLC5T6PWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G2ZB6NKWSZD6ZA2LDLLC5T6PWL","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":"7da541c847b309399e1ec5dd623614d7832fa6ee34ff58a4480e261188bfe777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T02:19:57Z","title_canon_sha256":"123bcde0a19716c4f8821b4f1635ce2c1228423656da2cdbaa28e83fc2ee0e5d"},"schema_version":"1.0","source":{"id":"1501.06235","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06235","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06235v7","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06235","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"G2ZB6NKWSZD6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G2ZB6NKWSZD6ZA2L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G2ZB6NKW","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:7555f2abab3686f32aae08d702be6cc7243f710d8b9e3469f7c3ee70d4739a7b","target":"graph","created_at":"2026-05-18T01:00:46Z","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 ${\\mathcal D}(n)$ be the maximal determinant for $n \\times n$ $\\{\\pm 1\\}$-matrices, and $\\mathcal R(n) = {\\mathcal D}(n)/n^{n/2}$ be the ratio of ${\\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds on ${\\mathcal D}(n)$ and $\\mathcal R(n)$ in terms of $d = n-h$, where $h$ is the order of a Hadamard matrix and $h$ is maximal subject to $h \\le n$. For example, $\\mathcal R(n) > (\\pi e/2)^{-d/2}$ if $1 \\le d \\le 3$, and $\\mathcal R(n) > (\\pi e/2)^{-d/2}(1 - d^2(\\pi/(2h))^{1/2})$ if $d > 3$. By a recent result of Livinskyi, $d^2/h^{1/2} \\to 0$","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":"2015-01-26T02:19:57Z","title":"Probabilistic lower bounds on maximal determinants of binary matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06235","kind":"arxiv","version":7},"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:ec1933be3a047aba939d3cf17457c1189d22106fe40c4d593446afb925528bba","target":"record","created_at":"2026-05-18T01:00:46Z","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":"7da541c847b309399e1ec5dd623614d7832fa6ee34ff58a4480e261188bfe777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T02:19:57Z","title_canon_sha256":"123bcde0a19716c4f8821b4f1635ce2c1228423656da2cdbaa28e83fc2ee0e5d"},"schema_version":"1.0","source":{"id":"1501.06235","kind":"arxiv","version":7}},"canonical_sha256":"36b21f35569647ec834b1ad62ecfcfb2c8fe82934e3e773f1252e63ef8756b9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b21f35569647ec834b1ad62ecfcfb2c8fe82934e3e773f1252e63ef8756b9a","first_computed_at":"2026-05-18T01:00:46.329092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:46.329092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZwD8yWr1aGBAeYhSCTRo/kmG4ysd5+euYxIkaA7ymxLEov78fzzy10fmc8mV2FTbcf/oJvhTvE+/WM5MT7yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:46.329496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06235","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec1933be3a047aba939d3cf17457c1189d22106fe40c4d593446afb925528bba","sha256:7555f2abab3686f32aae08d702be6cc7243f710d8b9e3469f7c3ee70d4739a7b"],"state_sha256":"e9a9822043cd9e820f9c6c61ee7625fef62707a9d9e9283baa1b8563cad20864"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPZYBiBtDnmRRcam181PxVFl9Y0QXdCYZDKggadJihvlCgKt5aDINfRC4KfubZIVOFwWNpYdjwql8EvRV2ouCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:27:56.472580Z","bundle_sha256":"b8dc0dd2b0b4cf9fb758857cdc9fcc500aeb14b45bdbd601a8d36fec95901533"}}