{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YOX46KIUFEM5QX3NSFVLAYRQ2L","short_pith_number":"pith:YOX46KIU","canonical_record":{"source":{"id":"1201.4021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-19T11:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"0adb01e64b6f3ed208c6b1c7c229111b3105d1989095c9d33607191668e99209","abstract_canon_sha256":"8525f8c16fb91b2803cd3947f43d48312dc3f6ccd5ad984b6bf4476dd876ff96"},"schema_version":"1.0"},"canonical_sha256":"c3afcf29142919d85f6d916ab06230d2fff65accac9a5665c554e9afd296c50b","source":{"kind":"arxiv","id":"1201.4021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4021","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4021v1","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4021","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"YOX46KIUFEM5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YOX46KIUFEM5QX3N","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YOX46KIU","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YOX46KIUFEM5QX3NSFVLAYRQ2L","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-19T11:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"0adb01e64b6f3ed208c6b1c7c229111b3105d1989095c9d33607191668e99209","abstract_canon_sha256":"8525f8c16fb91b2803cd3947f43d48312dc3f6ccd5ad984b6bf4476dd876ff96"},"schema_version":"1.0"},"canonical_sha256":"c3afcf29142919d85f6d916ab06230d2fff65accac9a5665c554e9afd296c50b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:16.145424Z","signature_b64":"iLcxmLpIIn++8jrnwxoHUWZx6GoR9O2xYGUS05qwXzrnhMqAPbx56CviAbryK4UzOgWL4tK64vXd/UtGWLH0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3afcf29142919d85f6d916ab06230d2fff65accac9a5665c554e9afd296c50b","last_reissued_at":"2026-05-18T04:04:16.144826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:16.144826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4021","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-05-18T04:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcLgx+cSpVOCnvn/HXAQLSVFDvKrSkH6HqVm6zaW3KvbfNmU0O3G8t99BWFAm0a67fJUIay3Cg4bNTbiVEK5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:15:41.543952Z"},"content_sha256":"532a88235dbe53007939885ac09381f38508ac4d9b72de2db6fdb04f70ac17f0","schema_version":"1.0","event_id":"sha256:532a88235dbe53007939885ac09381f38508ac4d9b72de2db6fdb04f70ac17f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YOX46KIUFEM5QX3NSFVLAYRQ2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Searching for partial Hadamard matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amparo Osuna, Elena Mart\\'in, F\\'elix Gudiel, Jos\\'e-Andr\\'es Armario, Mar\\'ia-Bel\\'en G\\\"uemes, Mar\\'ia-Dolores Frau, V\\'ictor \\'Alvarez","submitted_at":"2012-01-19T11:04:18Z","abstract_excerpt":"Three algorithms looking for pretty large partial Hadamard matrices are described. Here \"large\" means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [dLa00]) is achieved. The first one performs some kind of local exhaustive search, and consequently is expensive from the time consuming point of view. The second one comes from the adaptation of the best genetic algorithm known so far searching for cliques in a graph, due to Singh and Gupta [SG06]. The last one consists in another heuristic search, which prioritizes the required processing tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4021","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"},"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-18T04:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EF6rtuBLNlyeyaUpYM/v4MVmBJ8OrBug4IrLEX7fSnmf7fvuzjEWV0L9w6w9sUlPeqb7wIEoVn9TZktz8PhoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:15:41.544287Z"},"content_sha256":"86aa0448a8a741dc21aa59b4a65ab6ab2276a4bf088286cd376152d7a532957d","schema_version":"1.0","event_id":"sha256:86aa0448a8a741dc21aa59b4a65ab6ab2276a4bf088286cd376152d7a532957d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/bundle.json","state_url":"https://pith.science/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/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-06-23T02:15:41Z","links":{"resolver":"https://pith.science/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L","bundle":"https://pith.science/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/bundle.json","state":"https://pith.science/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOX46KIUFEM5QX3NSFVLAYRQ2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YOX46KIUFEM5QX3NSFVLAYRQ2L","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":"8525f8c16fb91b2803cd3947f43d48312dc3f6ccd5ad984b6bf4476dd876ff96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-19T11:04:18Z","title_canon_sha256":"0adb01e64b6f3ed208c6b1c7c229111b3105d1989095c9d33607191668e99209"},"schema_version":"1.0","source":{"id":"1201.4021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4021","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4021v1","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4021","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"YOX46KIUFEM5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YOX46KIUFEM5QX3N","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YOX46KIU","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:86aa0448a8a741dc21aa59b4a65ab6ab2276a4bf088286cd376152d7a532957d","target":"graph","created_at":"2026-05-18T04:04:16Z","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":"Three algorithms looking for pretty large partial Hadamard matrices are described. Here \"large\" means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [dLa00]) is achieved. The first one performs some kind of local exhaustive search, and consequently is expensive from the time consuming point of view. The second one comes from the adaptation of the best genetic algorithm known so far searching for cliques in a graph, due to Singh and Gupta [SG06]. The last one consists in another heuristic search, which prioritizes the required processing tim","authors_text":"Amparo Osuna, Elena Mart\\'in, F\\'elix Gudiel, Jos\\'e-Andr\\'es Armario, Mar\\'ia-Bel\\'en G\\\"uemes, Mar\\'ia-Dolores Frau, V\\'ictor \\'Alvarez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-19T11:04:18Z","title":"Searching for partial Hadamard matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4021","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:532a88235dbe53007939885ac09381f38508ac4d9b72de2db6fdb04f70ac17f0","target":"record","created_at":"2026-05-18T04:04:16Z","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":"8525f8c16fb91b2803cd3947f43d48312dc3f6ccd5ad984b6bf4476dd876ff96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-19T11:04:18Z","title_canon_sha256":"0adb01e64b6f3ed208c6b1c7c229111b3105d1989095c9d33607191668e99209"},"schema_version":"1.0","source":{"id":"1201.4021","kind":"arxiv","version":1}},"canonical_sha256":"c3afcf29142919d85f6d916ab06230d2fff65accac9a5665c554e9afd296c50b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3afcf29142919d85f6d916ab06230d2fff65accac9a5665c554e9afd296c50b","first_computed_at":"2026-05-18T04:04:16.144826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:16.144826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iLcxmLpIIn++8jrnwxoHUWZx6GoR9O2xYGUS05qwXzrnhMqAPbx56CviAbryK4UzOgWL4tK64vXd/UtGWLH0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:16.145424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:532a88235dbe53007939885ac09381f38508ac4d9b72de2db6fdb04f70ac17f0","sha256:86aa0448a8a741dc21aa59b4a65ab6ab2276a4bf088286cd376152d7a532957d"],"state_sha256":"22eccf71289399d16f6ffbffce78d76954d5a2f6ae68d272a771fb7cdb6d38fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPDumvqxNcFLQ87n8TxhTkecDLcmbT+CJWT36JLBsrT7M7Zm16oIju3YyMR2csDbpQ8QgAZo+Mqwsp/viVAACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:15:41.546250Z","bundle_sha256":"9d8d7e5455adb758c5ea0cd933a18527258552f88c79bc2565441d725b6bbdbd"}}