{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7LLHFOK32SL7UH3JGNS73SISZV","short_pith_number":"pith:7LLHFOK3","canonical_record":{"source":{"id":"1801.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T09:44:26Z","cross_cats_sorted":[],"title_canon_sha256":"46c596ff508d3d03ae05081516fce6923554af4a7abb186abf192d14c9b409c4","abstract_canon_sha256":"dcacb6b364f5809f7504724cd435d824c232598df2f734274e4737ee150cb8f5"},"schema_version":"1.0"},"canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","source":{"kind":"arxiv","id":"1801.04106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04106","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04106v1","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04106","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"7LLHFOK32SL7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7LLHFOK32SL7UH3J","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7LLHFOK3","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7LLHFOK32SL7UH3JGNS73SISZV","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T09:44:26Z","cross_cats_sorted":[],"title_canon_sha256":"46c596ff508d3d03ae05081516fce6923554af4a7abb186abf192d14c9b409c4","abstract_canon_sha256":"dcacb6b364f5809f7504724cd435d824c232598df2f734274e4737ee150cb8f5"},"schema_version":"1.0"},"canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:11.861549Z","signature_b64":"IkPrXXTbNmkseTFWuhJd5wq/YhQdvVGJK1MuSMA2+03jxroI0fnMUh++H6LhAmhxSa/CYyQKNrn/4/AwjixUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","last_reissued_at":"2026-05-18T00:26:11.860876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:11.860876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04106","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-18T00:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRtLRMmAWyffYbCW4ApTrnVc2y5YdTUg99t79dC0oxvnncuwqEWe444sB6HdVVUNfixXuWb8ArZnUtKjW6ccDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:32:35.182302Z"},"content_sha256":"03cd453261cf4745e9210ee49c3a8803deb3ec78b0d3d1ab984f1586e9638ce7","schema_version":"1.0","event_id":"sha256:03cd453261cf4745e9210ee49c3a8803deb3ec78b0d3d1ab984f1586e9638ce7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7LLHFOK32SL7UH3JGNS73SISZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect codes in generalized Fibonacci cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michel Mollard (IF)","submitted_at":"2018-01-12T09:44:26Z","abstract_excerpt":"The {\\em Fibonacci cube} of dimension $n$, denoted as $\\Gamma\\_n$,  is the subgraph of the $n$-cube $Q\\_n$ induced by vertices with no consecutive 1's. In an article of 2016  Ashrafi and his co-authors proved the non-existence of perfect codes in  $\\Gamma\\_n$ for $n\\geq 4$. As an open problem the authors suggest to consider the existence of perfect codes in generalization of Fibonacci cubes. The most direct generalization is the family $\\Gamma\\_n(1^s)$ of subgraphs induced by strings without $1^s$ as a substring where $s\\geq 2$ is a given integer. We prove the existence of a perfect code in $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04106","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-18T00:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtV074JMeqCbkv7JEcMnLrndx3qn0YIuowNKyljrVi831wzxAYbmCaKcwUUNni8xQ7wTy6su00kuqLvRK4lwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:32:35.182966Z"},"content_sha256":"929a1ccc52f542790d250a63d6bed17e20963f7576f602a67e64b8db750c2b24","schema_version":"1.0","event_id":"sha256:929a1ccc52f542790d250a63d6bed17e20963f7576f602a67e64b8db750c2b24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/bundle.json","state_url":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LLHFOK32SL7UH3JGNS73SISZV/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-07T14:32:35Z","links":{"resolver":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV","bundle":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/bundle.json","state":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LLHFOK32SL7UH3JGNS73SISZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7LLHFOK32SL7UH3JGNS73SISZV","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":"dcacb6b364f5809f7504724cd435d824c232598df2f734274e4737ee150cb8f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T09:44:26Z","title_canon_sha256":"46c596ff508d3d03ae05081516fce6923554af4a7abb186abf192d14c9b409c4"},"schema_version":"1.0","source":{"id":"1801.04106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04106","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04106v1","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04106","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"7LLHFOK32SL7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7LLHFOK32SL7UH3J","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7LLHFOK3","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:929a1ccc52f542790d250a63d6bed17e20963f7576f602a67e64b8db750c2b24","target":"graph","created_at":"2026-05-18T00:26:11Z","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":"The {\\em Fibonacci cube} of dimension $n$, denoted as $\\Gamma\\_n$,  is the subgraph of the $n$-cube $Q\\_n$ induced by vertices with no consecutive 1's. In an article of 2016  Ashrafi and his co-authors proved the non-existence of perfect codes in  $\\Gamma\\_n$ for $n\\geq 4$. As an open problem the authors suggest to consider the existence of perfect codes in generalization of Fibonacci cubes. The most direct generalization is the family $\\Gamma\\_n(1^s)$ of subgraphs induced by strings without $1^s$ as a substring where $s\\geq 2$ is a given integer. We prove the existence of a perfect code in $\\","authors_text":"Michel Mollard (IF)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T09:44:26Z","title":"Perfect codes in generalized Fibonacci cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04106","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:03cd453261cf4745e9210ee49c3a8803deb3ec78b0d3d1ab984f1586e9638ce7","target":"record","created_at":"2026-05-18T00:26:11Z","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":"dcacb6b364f5809f7504724cd435d824c232598df2f734274e4737ee150cb8f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T09:44:26Z","title_canon_sha256":"46c596ff508d3d03ae05081516fce6923554af4a7abb186abf192d14c9b409c4"},"schema_version":"1.0","source":{"id":"1801.04106","kind":"arxiv","version":1}},"canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","first_computed_at":"2026-05-18T00:26:11.860876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:11.860876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IkPrXXTbNmkseTFWuhJd5wq/YhQdvVGJK1MuSMA2+03jxroI0fnMUh++H6LhAmhxSa/CYyQKNrn/4/AwjixUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:11.861549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03cd453261cf4745e9210ee49c3a8803deb3ec78b0d3d1ab984f1586e9638ce7","sha256:929a1ccc52f542790d250a63d6bed17e20963f7576f602a67e64b8db750c2b24"],"state_sha256":"1f010b90e0bb87ff23fdc81b777a72bc94f608021a9768b26d554d23de957971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fwg2OuNXeZv8aJtGyxVWaxDY/JZ/wC8jiGTa4dFZDnVWdxPeuCBOJjUECJjVJsjPiImKDBklSnUSkm5KYtipBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:32:35.186262Z","bundle_sha256":"d0617d1153d383f71d8017557bbd00aa8b5416445b2a08aa869450d1e713df22"}}