{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UE2URCB7YHFVZ6CQ63CGVQWSR2","short_pith_number":"pith:UE2URCB7","schema_version":"1.0","canonical_sha256":"a13548883fc1cb5cf850f6c46ac2d28e92d488e45f3dbb6ea5d4f75750ecfd7a","source":{"kind":"arxiv","id":"1803.01480","version":1},"attestation_state":"computed","paper":{"title":"A doubling construction for Williamson matrices","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Curtis Bright","submitted_at":"2018-03-05T03:27:40Z","abstract_excerpt":"A construction that generates Williamson matrices of order $2n$ from Williamson matrices of odd order $n$ is presented. The construction is completely constructive and only uses three simple sequence operations."},"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":"1803.01480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T03:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"f795378f99970a27222987cce77a98d226cde4089e3e3d88d0b3707ccd60ddd4","abstract_canon_sha256":"ff22ab4a273559c2ed18c0f1593a8ee9336bb65b32f55910a804810e2018ca6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:00.543073Z","signature_b64":"8z0Mn0Zk4GfNbdpfqd0n0I6bxI1C/7KU7BmJhXJ5MJESoO9WY6Kkm29pn+WqmDh7FeXRo9B5UUCI3ngg1Ha+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a13548883fc1cb5cf850f6c46ac2d28e92d488e45f3dbb6ea5d4f75750ecfd7a","last_reissued_at":"2026-05-18T00:22:00.542552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:00.542552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A doubling construction for Williamson matrices","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Curtis Bright","submitted_at":"2018-03-05T03:27:40Z","abstract_excerpt":"A construction that generates Williamson matrices of order $2n$ from Williamson matrices of odd order $n$ is presented. The construction is completely constructive and only uses three simple sequence operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01480","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":""},"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":"1803.01480","created_at":"2026-05-18T00:22:00.542633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01480v1","created_at":"2026-05-18T00:22:00.542633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01480","created_at":"2026-05-18T00:22:00.542633+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE2URCB7YHFV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE2URCB7YHFVZ6CQ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE2URCB7","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2","json":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2.json","graph_json":"https://pith.science/api/pith-number/UE2URCB7YHFVZ6CQ63CGVQWSR2/graph.json","events_json":"https://pith.science/api/pith-number/UE2URCB7YHFVZ6CQ63CGVQWSR2/events.json","paper":"https://pith.science/paper/UE2URCB7"},"agent_actions":{"view_html":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2","download_json":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2.json","view_paper":"https://pith.science/paper/UE2URCB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01480&json=true","fetch_graph":"https://pith.science/api/pith-number/UE2URCB7YHFVZ6CQ63CGVQWSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/UE2URCB7YHFVZ6CQ63CGVQWSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2/action/storage_attestation","attest_author":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2/action/author_attestation","sign_citation":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2/action/citation_signature","submit_replication":"https://pith.science/pith/UE2URCB7YHFVZ6CQ63CGVQWSR2/action/replication_record"}},"created_at":"2026-05-18T00:22:00.542633+00:00","updated_at":"2026-05-18T00:22:00.542633+00:00"}