{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NQBFVGCFBWD2UHCAFQ6XFWXEQP","short_pith_number":"pith:NQBFVGCF","canonical_record":{"source":{"id":"1211.2723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T18:26:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ebb7c3a408e5bda9aa7ce97c3b8c9973f92a8bc7ef272d70069065ee50a553c","abstract_canon_sha256":"8d54805115f8019e397dd15e39d7aad291902d59eea0ab0a89c5fa5d21910f07"},"schema_version":"1.0"},"canonical_sha256":"6c025a98450d87aa1c402c3d72dae483e354bb32a79643b8d8958be635abcab1","source":{"kind":"arxiv","id":"1211.2723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2723","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2723v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2723","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"NQBFVGCFBWD2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQBFVGCFBWD2UHCA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQBFVGCF","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NQBFVGCFBWD2UHCAFQ6XFWXEQP","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T18:26:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ebb7c3a408e5bda9aa7ce97c3b8c9973f92a8bc7ef272d70069065ee50a553c","abstract_canon_sha256":"8d54805115f8019e397dd15e39d7aad291902d59eea0ab0a89c5fa5d21910f07"},"schema_version":"1.0"},"canonical_sha256":"6c025a98450d87aa1c402c3d72dae483e354bb32a79643b8d8958be635abcab1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.037303Z","signature_b64":"P5MGJWdECtk0TYupL09soSYxDR6kdPhy09jJg4b0i1lknGm3RnXbQ4Tv2mqH1Swc9J8aSAqgq1ODBzPi/YOoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c025a98450d87aa1c402c3d72dae483e354bb32a79643b8d8958be635abcab1","last_reissued_at":"2026-05-18T03:41:02.036814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.036814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2723","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YaKurl+AMdiKH0sFPkyWgmGOn9iO/v133e5hkk1VnmM8TSQoFlHl4Rhh6u3/EVhfF/IuRatcRacDRrFkK+ljBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:25:06.099064Z"},"content_sha256":"4f8ce1e24f2bd16024df2816b27db46da51386fd714e75f7a2134747576930a7","schema_version":"1.0","event_id":"sha256:4f8ce1e24f2bd16024df2816b27db46da51386fd714e75f7a2134747576930a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NQBFVGCFBWD2UHCAFQ6XFWXEQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Relationships among Optimal Symmetric Fix-Free Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Serap A. Savari, S. M. Hossein Tabatabaei Yazdi","submitted_at":"2012-11-12T18:26:32Z","abstract_excerpt":"Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they are not well understood. In earlier work we used a collection of instances of Boolean satisfiability problems as a tool in the generation of all optimal binary symmetric fix-free codes with n codewords and observed that the number of different optimal codelength sequences grows slowly compared with the corresponding number for prefix condition codes. We demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2723","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjVsgCXJuBM/cN8GGMhhIt/9yNmA2LhSnAv4Alczy9lFlE+yz0FCwVIZEbRHtslyTT7eEJq2BqETudg9oICgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:25:06.099486Z"},"content_sha256":"53aaf6d5496bfc96e377b43e4bc5e5d6e9cde4372a294b7a1a6acdeb64ebfbe3","schema_version":"1.0","event_id":"sha256:53aaf6d5496bfc96e377b43e4bc5e5d6e9cde4372a294b7a1a6acdeb64ebfbe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/bundle.json","state_url":"https://pith.science/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/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-31T08:25:06Z","links":{"resolver":"https://pith.science/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP","bundle":"https://pith.science/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/bundle.json","state":"https://pith.science/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQBFVGCFBWD2UHCAFQ6XFWXEQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NQBFVGCFBWD2UHCAFQ6XFWXEQP","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":"8d54805115f8019e397dd15e39d7aad291902d59eea0ab0a89c5fa5d21910f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T18:26:32Z","title_canon_sha256":"8ebb7c3a408e5bda9aa7ce97c3b8c9973f92a8bc7ef272d70069065ee50a553c"},"schema_version":"1.0","source":{"id":"1211.2723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2723","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2723v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2723","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"NQBFVGCFBWD2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQBFVGCFBWD2UHCA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQBFVGCF","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:53aaf6d5496bfc96e377b43e4bc5e5d6e9cde4372a294b7a1a6acdeb64ebfbe3","target":"graph","created_at":"2026-05-18T03:41:02Z","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":"Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they are not well understood. In earlier work we used a collection of instances of Boolean satisfiability problems as a tool in the generation of all optimal binary symmetric fix-free codes with n codewords and observed that the number of different optimal codelength sequences grows slowly compared with the corresponding number for prefix condition codes. We demons","authors_text":"Serap A. Savari, S. M. Hossein Tabatabaei Yazdi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T18:26:32Z","title":"On the Relationships among Optimal Symmetric Fix-Free Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2723","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:4f8ce1e24f2bd16024df2816b27db46da51386fd714e75f7a2134747576930a7","target":"record","created_at":"2026-05-18T03:41:02Z","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":"8d54805115f8019e397dd15e39d7aad291902d59eea0ab0a89c5fa5d21910f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T18:26:32Z","title_canon_sha256":"8ebb7c3a408e5bda9aa7ce97c3b8c9973f92a8bc7ef272d70069065ee50a553c"},"schema_version":"1.0","source":{"id":"1211.2723","kind":"arxiv","version":1}},"canonical_sha256":"6c025a98450d87aa1c402c3d72dae483e354bb32a79643b8d8958be635abcab1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c025a98450d87aa1c402c3d72dae483e354bb32a79643b8d8958be635abcab1","first_computed_at":"2026-05-18T03:41:02.036814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:02.036814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5MGJWdECtk0TYupL09soSYxDR6kdPhy09jJg4b0i1lknGm3RnXbQ4Tv2mqH1Swc9J8aSAqgq1ODBzPi/YOoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:02.037303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f8ce1e24f2bd16024df2816b27db46da51386fd714e75f7a2134747576930a7","sha256:53aaf6d5496bfc96e377b43e4bc5e5d6e9cde4372a294b7a1a6acdeb64ebfbe3"],"state_sha256":"1937c093d71673e3a8a5296fe884d6af7bb7e4c49468ac45c5bf715e2ccaed13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uXhbGue4oA8ZXMrp2UCePBK1OhbC4Bh2VC0KmI38Dlsd3b16d7/Y+n2uZnQVhXbdE0cCU7jK2q5ZCwYbS12CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:25:06.103629Z","bundle_sha256":"2888f21db285c1759b72bce923253d02f54817e9275c237dc55988449cd5eec3"}}