{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7LSUWBFJCTL6SSGHWJZZ4TCKE5","short_pith_number":"pith:7LSUWBFJ","schema_version":"1.0","canonical_sha256":"fae54b04a914d7e948c7b2739e4c4a27658888d23fa7200d61284e5c933a23ac","source":{"kind":"arxiv","id":"1211.2251","version":1},"attestation_state":"computed","paper":{"title":"Independent subsets of powers of paths, and Fibonacci cubes","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":"2012-11-09T21:30:06Z","abstract_excerpt":"We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself."},"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":"1211.2251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T21:30:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e07e2d590bb58dbf279bcbe86ff627b724d7dfe17b077d6be321d842e6232558","abstract_canon_sha256":"03af6b8b52c4cb2362a868a53332cfa437b44f1faac663f7cd39f57dba810a8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:35.971047Z","signature_b64":"GP5XqZf9KUyyVO36cEt9KcU6zVciqU6UIn/fSzxat/vzZdn0Ebt589uOCrjMnQhtAnExoISvzeoSEp7ZX7oIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae54b04a914d7e948c7b2739e4c4a27658888d23fa7200d61284e5c933a23ac","last_reissued_at":"2026-05-18T03:01:35.970364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:35.970364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent subsets of powers of paths, and Fibonacci cubes","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":"2012-11-09T21:30:06Z","abstract_excerpt":"We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2251","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":"1211.2251","created_at":"2026-05-18T03:01:35.970482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2251v1","created_at":"2026-05-18T03:01:35.970482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2251","created_at":"2026-05-18T03:01:35.970482+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LSUWBFJCTL6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LSUWBFJCTL6SSGH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LSUWBFJ","created_at":"2026-05-18T12:26:58.693483+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/7LSUWBFJCTL6SSGHWJZZ4TCKE5","json":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5.json","graph_json":"https://pith.science/api/pith-number/7LSUWBFJCTL6SSGHWJZZ4TCKE5/graph.json","events_json":"https://pith.science/api/pith-number/7LSUWBFJCTL6SSGHWJZZ4TCKE5/events.json","paper":"https://pith.science/paper/7LSUWBFJ"},"agent_actions":{"view_html":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5","download_json":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5.json","view_paper":"https://pith.science/paper/7LSUWBFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2251&json=true","fetch_graph":"https://pith.science/api/pith-number/7LSUWBFJCTL6SSGHWJZZ4TCKE5/graph.json","fetch_events":"https://pith.science/api/pith-number/7LSUWBFJCTL6SSGHWJZZ4TCKE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5/action/storage_attestation","attest_author":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5/action/author_attestation","sign_citation":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5/action/citation_signature","submit_replication":"https://pith.science/pith/7LSUWBFJCTL6SSGHWJZZ4TCKE5/action/replication_record"}},"created_at":"2026-05-18T03:01:35.970482+00:00","updated_at":"2026-05-18T03:01:35.970482+00:00"}