{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FOU5WVPEKJB4PQXDLSDNIW44PZ","short_pith_number":"pith:FOU5WVPE","canonical_record":{"source":{"id":"1402.6399","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-26T02:38:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"50aefa5412756deac5bcf7dee6ad65ec4ddc515691540165110b383265e54241","abstract_canon_sha256":"449fdadd30305535ffcd247ab1c13c7a511dfa2ef11fa2d330310e09f943f9b3"},"schema_version":"1.0"},"canonical_sha256":"2ba9db55e45243c7c2e35c86d45b9c7e5115f8c2701a19da155a68eeaa3a7d76","source":{"kind":"arxiv","id":"1402.6399","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6399","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6399v3","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6399","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"FOU5WVPEKJB4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOU5WVPEKJB4PQXD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOU5WVPE","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FOU5WVPEKJB4PQXDLSDNIW44PZ","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6399","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-26T02:38:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"50aefa5412756deac5bcf7dee6ad65ec4ddc515691540165110b383265e54241","abstract_canon_sha256":"449fdadd30305535ffcd247ab1c13c7a511dfa2ef11fa2d330310e09f943f9b3"},"schema_version":"1.0"},"canonical_sha256":"2ba9db55e45243c7c2e35c86d45b9c7e5115f8c2701a19da155a68eeaa3a7d76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:12.950955Z","signature_b64":"x8mpKjtsl8PsZsNijOyOSB6fvJK6bq8/XNin4vjdEJ34Pq4iEnq1wNhF/fDwGuDI3nfkW4hj/PEU1foJANMnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba9db55e45243c7c2e35c86d45b9c7e5115f8c2701a19da155a68eeaa3a7d76","last_reissued_at":"2026-05-18T02:55:12.950393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:12.950393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6399","source_version":3,"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-18T02:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq8DKg9J8ODQt9WLJoPbwPpcjpAB6kEZmhFT95oQpz//+13UX8NmS7y87GnxQPUFR7H+76w6z6kaBWatO654Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:26:53.799431Z"},"content_sha256":"d2122bcb4ac1d870215b3abf58841d4f36fbd5b89ea6f0f7335ef84c7a2cf3f9","schema_version":"1.0","event_id":"sha256:d2122bcb4ac1d870215b3abf58841d4f36fbd5b89ea6f0f7335ef84c7a2cf3f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FOU5WVPEKJB4PQXDLSDNIW44PZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formally self-dual linear binary codes from circulant graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Meiqin Wei, Ruihu Li, Xueliang Li, Yaping Mao","submitted_at":"2014-02-26T02:38:40Z","abstract_excerpt":"In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6399","kind":"arxiv","version":3},"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-18T02:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiLTaudaMEq7Gb/1m9kUtTXYCjJvFQZYE8/phTs9PnWdKmuaE/1GadN+mN5Gmp25Mkd97ka1Azr43kenXGlsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:26:53.799771Z"},"content_sha256":"534d1f982e1f2e811f8ae5675c0c7c4e60df10709fa624977deca98fb9c15a80","schema_version":"1.0","event_id":"sha256:534d1f982e1f2e811f8ae5675c0c7c4e60df10709fa624977deca98fb9c15a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/bundle.json","state_url":"https://pith.science/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/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-01T14:26:53Z","links":{"resolver":"https://pith.science/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ","bundle":"https://pith.science/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/bundle.json","state":"https://pith.science/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOU5WVPEKJB4PQXDLSDNIW44PZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FOU5WVPEKJB4PQXDLSDNIW44PZ","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":"449fdadd30305535ffcd247ab1c13c7a511dfa2ef11fa2d330310e09f943f9b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-26T02:38:40Z","title_canon_sha256":"50aefa5412756deac5bcf7dee6ad65ec4ddc515691540165110b383265e54241"},"schema_version":"1.0","source":{"id":"1402.6399","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6399","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6399v3","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6399","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"FOU5WVPEKJB4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOU5WVPEKJB4PQXD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOU5WVPE","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:534d1f982e1f2e811f8ae5675c0c7c4e60df10709fa624977deca98fb9c15a80","target":"graph","created_at":"2026-05-18T02:55:12Z","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":"In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.","authors_text":"Meiqin Wei, Ruihu Li, Xueliang Li, Yaping Mao","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-26T02:38:40Z","title":"Formally self-dual linear binary codes from circulant graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6399","kind":"arxiv","version":3},"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:d2122bcb4ac1d870215b3abf58841d4f36fbd5b89ea6f0f7335ef84c7a2cf3f9","target":"record","created_at":"2026-05-18T02:55:12Z","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":"449fdadd30305535ffcd247ab1c13c7a511dfa2ef11fa2d330310e09f943f9b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-26T02:38:40Z","title_canon_sha256":"50aefa5412756deac5bcf7dee6ad65ec4ddc515691540165110b383265e54241"},"schema_version":"1.0","source":{"id":"1402.6399","kind":"arxiv","version":3}},"canonical_sha256":"2ba9db55e45243c7c2e35c86d45b9c7e5115f8c2701a19da155a68eeaa3a7d76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ba9db55e45243c7c2e35c86d45b9c7e5115f8c2701a19da155a68eeaa3a7d76","first_computed_at":"2026-05-18T02:55:12.950393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:12.950393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8mpKjtsl8PsZsNijOyOSB6fvJK6bq8/XNin4vjdEJ34Pq4iEnq1wNhF/fDwGuDI3nfkW4hj/PEU1foJANMnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:12.950955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6399","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2122bcb4ac1d870215b3abf58841d4f36fbd5b89ea6f0f7335ef84c7a2cf3f9","sha256:534d1f982e1f2e811f8ae5675c0c7c4e60df10709fa624977deca98fb9c15a80"],"state_sha256":"12fad47b5fb36997fd9c247d28719a87a74b70ed9661fc5d826a7bb7f8fb6c04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBVVdLAel7XSGfmJUHVhyw+dDOXxMlO86E5SAw+pmkzpz2+4ivOyLIbpRt0Fd30HqGnl0NcuAVf5QcFiEuzUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:26:53.801725Z","bundle_sha256":"191315ea22f734feaabed9e3cc33f5b7045dd369ab7a0ce52b04e2e8f39bd22c"}}