{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CJVQ5LANOEYJOBNXJCHAGCLMXR","short_pith_number":"pith:CJVQ5LAN","canonical_record":{"source":{"id":"2007.09235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-17T21:07:20Z","cross_cats_sorted":[],"title_canon_sha256":"38ef7d227835645ac5b6a11207293dbcd1123725df5581f166c1f88b814d3cdc","abstract_canon_sha256":"b07c5436fb52ab4b20eec31d0b624f6921a7919e8072f811687fd7b7e552136c"},"schema_version":"1.0"},"canonical_sha256":"126b0eac0d71309705b7488e03096cbc4c205c0a8b5b5a8ad26bc3b36e063821","source":{"kind":"arxiv","id":"2007.09235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.09235","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"2007.09235v2","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09235","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"CJVQ5LANOEYJ","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"CJVQ5LANOEYJOBNX","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"CJVQ5LAN","created_at":"2026-07-05T01:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CJVQ5LANOEYJOBNXJCHAGCLMXR","target":"record","payload":{"canonical_record":{"source":{"id":"2007.09235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-17T21:07:20Z","cross_cats_sorted":[],"title_canon_sha256":"38ef7d227835645ac5b6a11207293dbcd1123725df5581f166c1f88b814d3cdc","abstract_canon_sha256":"b07c5436fb52ab4b20eec31d0b624f6921a7919e8072f811687fd7b7e552136c"},"schema_version":"1.0"},"canonical_sha256":"126b0eac0d71309705b7488e03096cbc4c205c0a8b5b5a8ad26bc3b36e063821","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:25.848951Z","signature_b64":"Gb+QOc2c5WjfWa4nDDumiEdaQeizi7JY+jmSqKvl3a3UYeWkYEELlO4CnGuol7oOelGIFtGPecGX1PdvBtg/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"126b0eac0d71309705b7488e03096cbc4c205c0a8b5b5a8ad26bc3b36e063821","last_reissued_at":"2026-07-05T01:27:25.848545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:25.848545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.09235","source_version":2,"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-05T01:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJ/OOpCFW/CceobEtc0I7BXqmFLzf15osCtGUeAtsVfdpxwVV9Q4KIAaoPoTLlO4i+rS+ogTrAd0k5zjA/vGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:15:12.956232Z"},"content_sha256":"f36ab899ab5fdc875c9e0696b721ca2d198612d42d4fdc0bc9ecefe2511e7f39","schema_version":"1.0","event_id":"sha256:f36ab899ab5fdc875c9e0696b721ca2d198612d42d4fdc0bc9ecefe2511e7f39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CJVQ5LANOEYJOBNXJCHAGCLMXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hadamard diagonalizable graphs of order at most 36","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander W. N. Riasanovksy, Bernard Lidick\\'y, Cedar Wiseman, Jane Breen, Melissa Fuentes, Michael Phillips, Ralihe R. Villagr\\'an, Steve Butler, Sung-Yell Song, Xiaohong Zhang","submitted_at":"2020-07-17T21:07:20Z","abstract_excerpt":"If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\\pm1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard matrix and the graph is said to be Hadamard diagonalizable.\n  In this article, we prove that if $n=8k+4$ the only possible Hadamard diagonalizable graphs are $K_n$, $K_{n/2,n/2}$, $2K_{n/2}$, and $nK_1$, and we develop an efficient computation for determining all graphs diagonalized by a given Hadamard matrix of any order. Using these two tools, we determine and present all Hadamard diagonalizable graphs up to order 36."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09235","kind":"arxiv","version":2},"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/2007.09235/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-05T01:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miITfDkJZXd5EDHkZKfaCP/OQdl5GYcGavpkREghMCl5MX80FNJSrHYOE1ZBKE4VC30ZWFxeUFR02vKAORnECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:15:12.956753Z"},"content_sha256":"ec0aa1c23dc30adb1b3be38b56aa89f0379bfb0bacfec09183f600d138dc7447","schema_version":"1.0","event_id":"sha256:ec0aa1c23dc30adb1b3be38b56aa89f0379bfb0bacfec09183f600d138dc7447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/bundle.json","state_url":"https://pith.science/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/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-20T04:15:12Z","links":{"resolver":"https://pith.science/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR","bundle":"https://pith.science/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/bundle.json","state":"https://pith.science/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJVQ5LANOEYJOBNXJCHAGCLMXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CJVQ5LANOEYJOBNXJCHAGCLMXR","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":"b07c5436fb52ab4b20eec31d0b624f6921a7919e8072f811687fd7b7e552136c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-17T21:07:20Z","title_canon_sha256":"38ef7d227835645ac5b6a11207293dbcd1123725df5581f166c1f88b814d3cdc"},"schema_version":"1.0","source":{"id":"2007.09235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.09235","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"2007.09235v2","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09235","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"CJVQ5LANOEYJ","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"CJVQ5LANOEYJOBNX","created_at":"2026-07-05T01:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"CJVQ5LAN","created_at":"2026-07-05T01:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:ec0aa1c23dc30adb1b3be38b56aa89f0379bfb0bacfec09183f600d138dc7447","target":"graph","created_at":"2026-07-05T01:27:25Z","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/2007.09235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\\pm1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard matrix and the graph is said to be Hadamard diagonalizable.\n  In this article, we prove that if $n=8k+4$ the only possible Hadamard diagonalizable graphs are $K_n$, $K_{n/2,n/2}$, $2K_{n/2}$, and $nK_1$, and we develop an efficient computation for determining all graphs diagonalized by a given Hadamard matrix of any order. Using these two tools, we determine and present all Hadamard diagonalizable graphs up to order 36.","authors_text":"Alexander W. N. Riasanovksy, Bernard Lidick\\'y, Cedar Wiseman, Jane Breen, Melissa Fuentes, Michael Phillips, Ralihe R. Villagr\\'an, Steve Butler, Sung-Yell Song, Xiaohong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-17T21:07:20Z","title":"Hadamard diagonalizable graphs of order at most 36"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09235","kind":"arxiv","version":2},"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:f36ab899ab5fdc875c9e0696b721ca2d198612d42d4fdc0bc9ecefe2511e7f39","target":"record","created_at":"2026-07-05T01:27:25Z","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":"b07c5436fb52ab4b20eec31d0b624f6921a7919e8072f811687fd7b7e552136c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-17T21:07:20Z","title_canon_sha256":"38ef7d227835645ac5b6a11207293dbcd1123725df5581f166c1f88b814d3cdc"},"schema_version":"1.0","source":{"id":"2007.09235","kind":"arxiv","version":2}},"canonical_sha256":"126b0eac0d71309705b7488e03096cbc4c205c0a8b5b5a8ad26bc3b36e063821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"126b0eac0d71309705b7488e03096cbc4c205c0a8b5b5a8ad26bc3b36e063821","first_computed_at":"2026-07-05T01:27:25.848545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:25.848545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gb+QOc2c5WjfWa4nDDumiEdaQeizi7JY+jmSqKvl3a3UYeWkYEELlO4CnGuol7oOelGIFtGPecGX1PdvBtg/AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:25.848951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.09235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36ab899ab5fdc875c9e0696b721ca2d198612d42d4fdc0bc9ecefe2511e7f39","sha256:ec0aa1c23dc30adb1b3be38b56aa89f0379bfb0bacfec09183f600d138dc7447"],"state_sha256":"817940b7112fa13c03525f3996aeda27931d0e1a89063d1b52a38f59ecb83cdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dg5FbfIISyz/XI2adMVCIs1y2Atqrhw+WOxa/yhf26Dg+OBzB0G0UEIiIO4aj8GSfsUxaEknzWX/c5GPI6ihCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:15:12.962813Z","bundle_sha256":"5aa3c5abbd5152a493201c0daee41ffd25a148dc277c9464fbcb2a5c52236ff9"}}