{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6BM2ERWWFMO22WSNGALOF5JNJS","short_pith_number":"pith:6BM2ERWW","canonical_record":{"source":{"id":"2306.16812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-29T09:48:31Z","cross_cats_sorted":[],"title_canon_sha256":"57edbc9ac4715a725d954f5127e7b3f1132b9da7f8b33867c7b6a31cbc82062b","abstract_canon_sha256":"478a228ef147ac75ff948a415e839c5c3d896465275431ddadbbd6fcc9cd07aa"},"schema_version":"1.0"},"canonical_sha256":"f059a246d62b1dad5a4d3016e2f52d4c9d9c00c378f682024f3862471b854d94","source":{"kind":"arxiv","id":"2306.16812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.16812","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"2306.16812v1","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16812","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"6BM2ERWWFMO2","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"6BM2ERWWFMO22WSN","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"6BM2ERWW","created_at":"2026-07-05T06:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6BM2ERWWFMO22WSNGALOF5JNJS","target":"record","payload":{"canonical_record":{"source":{"id":"2306.16812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-29T09:48:31Z","cross_cats_sorted":[],"title_canon_sha256":"57edbc9ac4715a725d954f5127e7b3f1132b9da7f8b33867c7b6a31cbc82062b","abstract_canon_sha256":"478a228ef147ac75ff948a415e839c5c3d896465275431ddadbbd6fcc9cd07aa"},"schema_version":"1.0"},"canonical_sha256":"f059a246d62b1dad5a4d3016e2f52d4c9d9c00c378f682024f3862471b854d94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:09.919704Z","signature_b64":"PgpeyzxGnx7byxkYqTwbajBtZIYwWoA1gYBs1yA095RDsHe1QJS6lv0VBROYUwkXPGN0nUMF5MrXObSJEkYSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f059a246d62b1dad5a4d3016e2f52d4c9d9c00c378f682024f3862471b854d94","last_reissued_at":"2026-07-05T06:26:09.919211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:09.919211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.16812","source_version":1,"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-07-05T06:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jUUesf+RqvWDiIKtYCYqIKuEPNHRvK2FiMnF28eAywZBM6/KtX6NAUGiUvpKegMlh6Gv0HNHUIJN8QZFeEICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:09:58.076968Z"},"content_sha256":"48a56bbea95726148cb69d233e91b799155cc25e5ffaea12cafc469f050fa065","schema_version":"1.0","event_id":"sha256:48a56bbea95726148cb69d233e91b799155cc25e5ffaea12cafc469f050fa065"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6BM2ERWWFMO22WSNGALOF5JNJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementing Hadamard Matrices in SageMath","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Matteo Cati","submitted_at":"2023-06-29T09:48:31Z","abstract_excerpt":"Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that works for all values of $n$, and for some orders no Hadamard matrix has yet been found. Given the many practical applications of these matrices, it would be useful to have a way to easily check if a construction for a Hadamard matrix of order $n$ exists, and in case to create it. This project aimed to address this, by implementing constructions of Hadamard a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16812","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/2306.16812/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"},"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-07-05T06:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdKQuQsuWMuTKHgFv2UayoR0G5aj8ke27RMkKcl8bAYjo79Ibro4qpQt4nfySa1D4pzEWY/xVykQV0VcU1a5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:09:58.078346Z"},"content_sha256":"d9cc32c5dacae805e73340fabf77e0de9f107c87abf2217e3492e82d26ce2210","schema_version":"1.0","event_id":"sha256:d9cc32c5dacae805e73340fabf77e0de9f107c87abf2217e3492e82d26ce2210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BM2ERWWFMO22WSNGALOF5JNJS/bundle.json","state_url":"https://pith.science/pith/6BM2ERWWFMO22WSNGALOF5JNJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BM2ERWWFMO22WSNGALOF5JNJS/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-08-12T23:09:58Z","links":{"resolver":"https://pith.science/pith/6BM2ERWWFMO22WSNGALOF5JNJS","bundle":"https://pith.science/pith/6BM2ERWWFMO22WSNGALOF5JNJS/bundle.json","state":"https://pith.science/pith/6BM2ERWWFMO22WSNGALOF5JNJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BM2ERWWFMO22WSNGALOF5JNJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6BM2ERWWFMO22WSNGALOF5JNJS","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":"478a228ef147ac75ff948a415e839c5c3d896465275431ddadbbd6fcc9cd07aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-29T09:48:31Z","title_canon_sha256":"57edbc9ac4715a725d954f5127e7b3f1132b9da7f8b33867c7b6a31cbc82062b"},"schema_version":"1.0","source":{"id":"2306.16812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.16812","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"2306.16812v1","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16812","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"6BM2ERWWFMO2","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"6BM2ERWWFMO22WSN","created_at":"2026-07-05T06:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"6BM2ERWW","created_at":"2026-07-05T06:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:d9cc32c5dacae805e73340fabf77e0de9f107c87abf2217e3492e82d26ce2210","target":"graph","created_at":"2026-07-05T06:26:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.16812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that works for all values of $n$, and for some orders no Hadamard matrix has yet been found. Given the many practical applications of these matrices, it would be useful to have a way to easily check if a construction for a Hadamard matrix of order $n$ exists, and in case to create it. This project aimed to address this, by implementing constructions of Hadamard a","authors_text":"Dmitrii V. Pasechnik, Matteo Cati","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-29T09:48:31Z","title":"Implementing Hadamard Matrices in SageMath"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16812","kind":"arxiv","version":1},"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:48a56bbea95726148cb69d233e91b799155cc25e5ffaea12cafc469f050fa065","target":"record","created_at":"2026-07-05T06:26:09Z","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":"478a228ef147ac75ff948a415e839c5c3d896465275431ddadbbd6fcc9cd07aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-29T09:48:31Z","title_canon_sha256":"57edbc9ac4715a725d954f5127e7b3f1132b9da7f8b33867c7b6a31cbc82062b"},"schema_version":"1.0","source":{"id":"2306.16812","kind":"arxiv","version":1}},"canonical_sha256":"f059a246d62b1dad5a4d3016e2f52d4c9d9c00c378f682024f3862471b854d94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f059a246d62b1dad5a4d3016e2f52d4c9d9c00c378f682024f3862471b854d94","first_computed_at":"2026-07-05T06:26:09.919211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:26:09.919211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PgpeyzxGnx7byxkYqTwbajBtZIYwWoA1gYBs1yA095RDsHe1QJS6lv0VBROYUwkXPGN0nUMF5MrXObSJEkYSCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:26:09.919704Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.16812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a56bbea95726148cb69d233e91b799155cc25e5ffaea12cafc469f050fa065","sha256:d9cc32c5dacae805e73340fabf77e0de9f107c87abf2217e3492e82d26ce2210"],"state_sha256":"b0dfcf4a398173f7eb517913e6631a27342a87e3d4f3bdd7107bbb66f53aaa80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtQPq0lDRJJB8D2oUMHxVCI7ytbRLXCqLgZRV4Az1saVl84F/2P1NXu0BmKy167fkcpmoTVx4X75nCDN/gCKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:09:58.082671Z","bundle_sha256":"0b41219089541356aa47eaed3c78c41770c3d2e055a11e9e544c026df21c8bed"}}