{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NMVNTNRWMJU72WQC57F2FDJHDF","short_pith_number":"pith:NMVNTNRW","schema_version":"1.0","canonical_sha256":"6b2ad9b6366269fd5a02efcba28d2719560eb1d120b4b9f84cbcbf07855c1f87","source":{"kind":"arxiv","id":"1410.4080","version":2},"attestation_state":"computed","paper":{"title":"Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ottavio M. D'Antona, Pietro Codara","submitted_at":"2014-10-15T14:53:39Z","abstract_excerpt":"The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively.\n  In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets of the h-th power of a path ordered by inclusion. For h=1 such a diagram is called a Fibonacci cube, and for h>1 we obtain a generalization of the Fibonacci cube. Consequently, we derive a generalized notion of Fibonacci sequence, called h-Fibonacci sequence. Then, we show that the number of edges of a generalized Fibonacci cube is obtained by c"},"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":"1410.4080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-15T14:53:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e049158b5625c27f66dd91195e7b78c59af39d2dcea3b296aeb63f01d368eaf0","abstract_canon_sha256":"bf9a31e06ebf949042e4bba730b9a39d77d578e74d2327fc73002d531bd647f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:24.342497Z","signature_b64":"s4s8aj54Sle7kgyknipwapic2EeDGo47Ou8YaoUWPNnjBTXZBhwbEIA7hHxl7pwAD8vkfI8Otc2i51r2bvZfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b2ad9b6366269fd5a02efcba28d2719560eb1d120b4b9f84cbcbf07855c1f87","last_reissued_at":"2026-05-18T01:33:24.341887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:24.341887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ottavio M. D'Antona, Pietro Codara","submitted_at":"2014-10-15T14:53:39Z","abstract_excerpt":"The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively.\n  In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets of the h-th power of a path ordered by inclusion. For h=1 such a diagram is called a Fibonacci cube, and for h>1 we obtain a generalization of the Fibonacci cube. Consequently, we derive a generalized notion of Fibonacci sequence, called h-Fibonacci sequence. Then, we show that the number of edges of a generalized Fibonacci cube is obtained by c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4080","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":"1410.4080","created_at":"2026-05-18T01:33:24.341972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4080v2","created_at":"2026-05-18T01:33:24.341972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4080","created_at":"2026-05-18T01:33:24.341972+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMVNTNRWMJU7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMVNTNRWMJU72WQC","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMVNTNRW","created_at":"2026-05-18T12:28:41.024544+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/NMVNTNRWMJU72WQC57F2FDJHDF","json":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF.json","graph_json":"https://pith.science/api/pith-number/NMVNTNRWMJU72WQC57F2FDJHDF/graph.json","events_json":"https://pith.science/api/pith-number/NMVNTNRWMJU72WQC57F2FDJHDF/events.json","paper":"https://pith.science/paper/NMVNTNRW"},"agent_actions":{"view_html":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF","download_json":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF.json","view_paper":"https://pith.science/paper/NMVNTNRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4080&json=true","fetch_graph":"https://pith.science/api/pith-number/NMVNTNRWMJU72WQC57F2FDJHDF/graph.json","fetch_events":"https://pith.science/api/pith-number/NMVNTNRWMJU72WQC57F2FDJHDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF/action/storage_attestation","attest_author":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF/action/author_attestation","sign_citation":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF/action/citation_signature","submit_replication":"https://pith.science/pith/NMVNTNRWMJU72WQC57F2FDJHDF/action/replication_record"}},"created_at":"2026-05-18T01:33:24.341972+00:00","updated_at":"2026-05-18T01:33:24.341972+00:00"}