{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3Y4JYW3C3LGI5FJLSTS7IZ75LS","short_pith_number":"pith:3Y4JYW3C","canonical_record":{"source":{"id":"1209.0236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-03T03:29:10Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"808b85605bf835dde1a5abfc3f2327000c9de8c92780abef86b9159573f2eb3c","abstract_canon_sha256":"ed10ad4c5256b872cdfdce431a4b26f8535d5fffbed80a04fc9eaddfab4b0052"},"schema_version":"1.0"},"canonical_sha256":"de389c5b62dacc8e952b94e5f467fd5cb9408a56523d9084b3b288a117be6816","source":{"kind":"arxiv","id":"1209.0236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0236","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0236v2","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0236","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"3Y4JYW3C3LGI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Y4JYW3C3LGI5FJL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Y4JYW3C","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3Y4JYW3C3LGI5FJLSTS7IZ75LS","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-03T03:29:10Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"808b85605bf835dde1a5abfc3f2327000c9de8c92780abef86b9159573f2eb3c","abstract_canon_sha256":"ed10ad4c5256b872cdfdce431a4b26f8535d5fffbed80a04fc9eaddfab4b0052"},"schema_version":"1.0"},"canonical_sha256":"de389c5b62dacc8e952b94e5f467fd5cb9408a56523d9084b3b288a117be6816","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:29.491442Z","signature_b64":"UFcyhFC5LXk7Qr6OK/fhj2RX7XdzWXlQrUL1jfkeTMuRjd1q4v5Yb4ts+9sNTYWSm7qAuxTR+7D0NzhdaLBeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de389c5b62dacc8e952b94e5f467fd5cb9408a56523d9084b3b288a117be6816","last_reissued_at":"2026-05-18T03:31:29.490738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:29.490738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0236","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-05-18T03:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbcP2SiTMKyYItxaeWF2W38Nzqxn0DdW7PL1vkYrcxUznKR2c9AWv7G9QGto3X6A0DDYP9aNUD4xUpLyrIzBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:26:39.117700Z"},"content_sha256":"8b61a96c9dce3bf573de066d13896e5c9ec2f6c568bbbf6084fb3b8c3ab37dad","schema_version":"1.0","event_id":"sha256:8b61a96c9dce3bf573de066d13896e5c9ec2f6c568bbbf6084fb3b8c3ab37dad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3Y4JYW3C3LGI5FJLSTS7IZ75LS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Bifix-Free Codes Within a Constant Factor of Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chengmin Wang, Han Mao Kiah, Punarbasu Purkayastha, Yeow Meng Chee","submitted_at":"2012-09-03T03:29:10Z","abstract_excerpt":"A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new construction of cross-bifix-free codes which generalizes the construction in Bajic (2007) to longer code lengths and to any alphabet size. The codes are shown to be nearly optimal in size. We also establish new results on Fibonacci sequences, that are used in estimating the size of the cross-bifix-free codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0236","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":""},"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-18T03:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQt2pQ0y4I04wsFUUBYACayfo7+Mw7J6YBN+CBjD+kPrQfKuBTLxnvtd59HBEHnkkdJHskWF24kTVfNVP9DXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:26:39.118088Z"},"content_sha256":"5baef4e075bcb190e8fddfeaa7402da04334d9ff53eee5ee4513f202b1e48ac2","schema_version":"1.0","event_id":"sha256:5baef4e075bcb190e8fddfeaa7402da04334d9ff53eee5ee4513f202b1e48ac2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/bundle.json","state_url":"https://pith.science/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/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-05-31T23:26:39Z","links":{"resolver":"https://pith.science/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS","bundle":"https://pith.science/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/bundle.json","state":"https://pith.science/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Y4JYW3C3LGI5FJLSTS7IZ75LS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3Y4JYW3C3LGI5FJLSTS7IZ75LS","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":"ed10ad4c5256b872cdfdce431a4b26f8535d5fffbed80a04fc9eaddfab4b0052","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-03T03:29:10Z","title_canon_sha256":"808b85605bf835dde1a5abfc3f2327000c9de8c92780abef86b9159573f2eb3c"},"schema_version":"1.0","source":{"id":"1209.0236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0236","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0236v2","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0236","created_at":"2026-05-18T03:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"3Y4JYW3C3LGI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Y4JYW3C3LGI5FJL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Y4JYW3C","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:5baef4e075bcb190e8fddfeaa7402da04334d9ff53eee5ee4513f202b1e48ac2","target":"graph","created_at":"2026-05-18T03:31:29Z","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":"A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new construction of cross-bifix-free codes which generalizes the construction in Bajic (2007) to longer code lengths and to any alphabet size. The codes are shown to be nearly optimal in size. We also establish new results on Fibonacci sequences, that are used in estimating the size of the cross-bifix-free codes.","authors_text":"Chengmin Wang, Han Mao Kiah, Punarbasu Purkayastha, Yeow Meng Chee","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-03T03:29:10Z","title":"Cross-Bifix-Free Codes Within a Constant Factor of Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0236","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:8b61a96c9dce3bf573de066d13896e5c9ec2f6c568bbbf6084fb3b8c3ab37dad","target":"record","created_at":"2026-05-18T03:31:29Z","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":"ed10ad4c5256b872cdfdce431a4b26f8535d5fffbed80a04fc9eaddfab4b0052","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-03T03:29:10Z","title_canon_sha256":"808b85605bf835dde1a5abfc3f2327000c9de8c92780abef86b9159573f2eb3c"},"schema_version":"1.0","source":{"id":"1209.0236","kind":"arxiv","version":2}},"canonical_sha256":"de389c5b62dacc8e952b94e5f467fd5cb9408a56523d9084b3b288a117be6816","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de389c5b62dacc8e952b94e5f467fd5cb9408a56523d9084b3b288a117be6816","first_computed_at":"2026-05-18T03:31:29.490738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:29.490738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFcyhFC5LXk7Qr6OK/fhj2RX7XdzWXlQrUL1jfkeTMuRjd1q4v5Yb4ts+9sNTYWSm7qAuxTR+7D0NzhdaLBeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:29.491442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b61a96c9dce3bf573de066d13896e5c9ec2f6c568bbbf6084fb3b8c3ab37dad","sha256:5baef4e075bcb190e8fddfeaa7402da04334d9ff53eee5ee4513f202b1e48ac2"],"state_sha256":"bf7d6512129e94da8b4ae4adf5be3e49a9fde2aaea0d2d8396c541871758b4d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uc21LlyMpf/JqhpcxG/rqcUsy0KBwaAdOdKSGlpPbpV+Z6Tfd/FzbEjpvQ0y3oqBOUupdf2kTXZbwOYXcXNMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:26:39.121296Z","bundle_sha256":"31111196420980ace577eebdd81d75d4c70ebd9b4e1eb22cb5facd8249dc782b"}}