{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LHBTVDLLG72IZW2NMUBBX4272N","short_pith_number":"pith:LHBTVDLL","schema_version":"1.0","canonical_sha256":"59c33a8d6b37f48cdb4d65021bf35fd37a8aead87a466f4e00b8c33d9193028b","source":{"kind":"arxiv","id":"2010.05518","version":3},"attestation_state":"computed","paper":{"title":"Fibonacci-run graphs I: basic properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\\"Omer E\\u{g}ecio\\u{g}lu, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2020-10-12T08:20:08Z","abstract_excerpt":"Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s, counted by Fibonacci numbers. Another set of binary strings which are counted by Fibonacci numbers are those with a restriction on the runlengths. Induced subgraphs of the hypercube on the latter strings as vertices define Fibonacci-run graphs. They have the same number of vertices as Fibonacci cubes, but fewer edges and different connectivity properties"},"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":"2010.05518","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-12T08:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"84eff04ee67cde2aa3eb7e665a5ce60a2924620032c078ef05b30be2f1fb7017","abstract_canon_sha256":"4e2280d7c60366f70cf4a46fbe07656a0021a6f1030bdfa35f71aa1984759ef6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:27.126913Z","signature_b64":"3TPclKHwO/Lq0MFoBJtLtDmOZpPmG/b4ZPPU49YisDKscOBcuweaudL1OOZfuKhfLFKVVErqcRhmX8kt5VW7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c33a8d6b37f48cdb4d65021bf35fd37a8aead87a466f4e00b8c33d9193028b","last_reissued_at":"2026-07-05T02:10:27.126426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:27.126426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fibonacci-run graphs I: basic properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\\"Omer E\\u{g}ecio\\u{g}lu, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2020-10-12T08:20:08Z","abstract_excerpt":"Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s, counted by Fibonacci numbers. Another set of binary strings which are counted by Fibonacci numbers are those with a restriction on the runlengths. Induced subgraphs of the hypercube on the latter strings as vertices define Fibonacci-run graphs. They have the same number of vertices as Fibonacci cubes, but fewer edges and different connectivity properties"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05518","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.05518/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.05518","created_at":"2026-07-05T02:10:27.126492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.05518v3","created_at":"2026-07-05T02:10:27.126492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05518","created_at":"2026-07-05T02:10:27.126492+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHBTVDLLG72I","created_at":"2026-07-05T02:10:27.126492+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHBTVDLLG72IZW2N","created_at":"2026-07-05T02:10:27.126492+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHBTVDLL","created_at":"2026-07-05T02:10:27.126492+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/LHBTVDLLG72IZW2NMUBBX4272N","json":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N.json","graph_json":"https://pith.science/api/pith-number/LHBTVDLLG72IZW2NMUBBX4272N/graph.json","events_json":"https://pith.science/api/pith-number/LHBTVDLLG72IZW2NMUBBX4272N/events.json","paper":"https://pith.science/paper/LHBTVDLL"},"agent_actions":{"view_html":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N","download_json":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N.json","view_paper":"https://pith.science/paper/LHBTVDLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.05518&json=true","fetch_graph":"https://pith.science/api/pith-number/LHBTVDLLG72IZW2NMUBBX4272N/graph.json","fetch_events":"https://pith.science/api/pith-number/LHBTVDLLG72IZW2NMUBBX4272N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N/action/storage_attestation","attest_author":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N/action/author_attestation","sign_citation":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N/action/citation_signature","submit_replication":"https://pith.science/pith/LHBTVDLLG72IZW2NMUBBX4272N/action/replication_record"}},"created_at":"2026-07-05T02:10:27.126492+00:00","updated_at":"2026-07-05T02:10:27.126492+00:00"}