{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7LLHFOK32SL7UH3JGNS73SISZV","short_pith_number":"pith:7LLHFOK3","schema_version":"1.0","canonical_sha256":"fad672b95bd497fa1f693365fdc912cd6297b3a0e9c40e12caa4890f08d80505","source":{"kind":"arxiv","id":"1801.04106","version":1},"attestation_state":"computed","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 $\\"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04106","created_at":"2026-05-18T00:26:11.860989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04106v1","created_at":"2026-05-18T00:26:11.860989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04106","created_at":"2026-05-18T00:26:11.860989+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LLHFOK32SL7","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LLHFOK32SL7UH3J","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LLHFOK3","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV","json":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV.json","graph_json":"https://pith.science/api/pith-number/7LLHFOK32SL7UH3JGNS73SISZV/graph.json","events_json":"https://pith.science/api/pith-number/7LLHFOK32SL7UH3JGNS73SISZV/events.json","paper":"https://pith.science/paper/7LLHFOK3"},"agent_actions":{"view_html":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV","download_json":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV.json","view_paper":"https://pith.science/paper/7LLHFOK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04106&json=true","fetch_graph":"https://pith.science/api/pith-number/7LLHFOK32SL7UH3JGNS73SISZV/graph.json","fetch_events":"https://pith.science/api/pith-number/7LLHFOK32SL7UH3JGNS73SISZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/action/storage_attestation","attest_author":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/action/author_attestation","sign_citation":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/action/citation_signature","submit_replication":"https://pith.science/pith/7LLHFOK32SL7UH3JGNS73SISZV/action/replication_record"}},"created_at":"2026-05-18T00:26:11.860989+00:00","updated_at":"2026-05-18T00:26:11.860989+00:00"}