{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:43RSUAIF7H5ESULYO7PXWFAITQ","short_pith_number":"pith:43RSUAIF","schema_version":"1.0","canonical_sha256":"e6e32a0105f9fa49517877df7b14089c2d4db8d0d3b13a003bb95d16599e21e6","source":{"kind":"arxiv","id":"1606.00138","version":2},"attestation_state":"computed","paper":{"title":"Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michel Mollard (IF)","submitted_at":"2016-06-01T07:01:13Z","abstract_excerpt":"The Fibonacci cube of dimension n, denoted as $\\Gamma$ n , is the subgraph of n-cube Q n induced by vertices with no consecutive 1's. In this short note we prove that asymptotically all vertices of $\\Gamma$ n are covered by a maximum set of disjoint subgraphs isomorphic to Q k , answering an open problem proposed in [2]."},"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":"1606.00138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-01T07:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"c354efe72e570ad312513e894f2d85f5c1aff73ac18ec463e92063bc963e6ec6","abstract_canon_sha256":"f6f24a1fb25ec229351f78ff3d0de52bf6e952a56b7bce3384ed4e7956518d15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:04.199483Z","signature_b64":"N7DQrdMNzXrOKc94ETJ2w5BZW7kokGVXhIK150RKHOMKhWoyvWEuEnH3Hp3FWEyCCJWoMXS5Dh43JrI7jK87BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e32a0105f9fa49517877df7b14089c2d4db8d0d3b13a003bb95d16599e21e6","last_reissued_at":"2026-05-18T01:02:04.198772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:04.198772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michel Mollard (IF)","submitted_at":"2016-06-01T07:01:13Z","abstract_excerpt":"The Fibonacci cube of dimension n, denoted as $\\Gamma$ n , is the subgraph of n-cube Q n induced by vertices with no consecutive 1's. In this short note we prove that asymptotically all vertices of $\\Gamma$ n are covered by a maximum set of disjoint subgraphs isomorphic to Q k , answering an open problem proposed in [2]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00138","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00138","created_at":"2026-05-18T01:02:04.198890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00138v2","created_at":"2026-05-18T01:02:04.198890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00138","created_at":"2026-05-18T01:02:04.198890+00:00"},{"alias_kind":"pith_short_12","alias_value":"43RSUAIF7H5E","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"43RSUAIF7H5ESULY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"43RSUAIF","created_at":"2026-05-18T12:29:58.707656+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/43RSUAIF7H5ESULYO7PXWFAITQ","json":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ.json","graph_json":"https://pith.science/api/pith-number/43RSUAIF7H5ESULYO7PXWFAITQ/graph.json","events_json":"https://pith.science/api/pith-number/43RSUAIF7H5ESULYO7PXWFAITQ/events.json","paper":"https://pith.science/paper/43RSUAIF"},"agent_actions":{"view_html":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ","download_json":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ.json","view_paper":"https://pith.science/paper/43RSUAIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00138&json=true","fetch_graph":"https://pith.science/api/pith-number/43RSUAIF7H5ESULYO7PXWFAITQ/graph.json","fetch_events":"https://pith.science/api/pith-number/43RSUAIF7H5ESULYO7PXWFAITQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ/action/storage_attestation","attest_author":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ/action/author_attestation","sign_citation":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ/action/citation_signature","submit_replication":"https://pith.science/pith/43RSUAIF7H5ESULYO7PXWFAITQ/action/replication_record"}},"created_at":"2026-05-18T01:02:04.198890+00:00","updated_at":"2026-05-18T01:02:04.198890+00:00"}