{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LULKP4PYZXUFGVZNYEG3DZKHQB","short_pith_number":"pith:LULKP4PY","schema_version":"1.0","canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","source":{"kind":"arxiv","id":"1501.00378","version":1},"attestation_state":"computed","paper":{"title":"Proofs of two conjectures on generalized Fibonacci cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Jianxin Wei","submitted_at":"2015-01-02T10:49:04Z","abstract_excerpt":"A binary string $f$ is a factor of string $u$ if $f$ appears as a sequence of $|f|$ consecutive bits of $u$, where $|f|$ denotes the length of $f$. Generalized Fibonacci cube $Q_{d}(f)$ is the graph obtained from the $d$-cube $Q_{d}$ by removing all vertices that contain a given binary string $f$ as a factor. A binary string $f$ is called good if $Q_{d}(f)$ is an isometric subgraph of $Q_{d}$ for all $d\\geq1$, it is called bad otherwise. The index of a binary string $f$, denoted by $B(f)$, is the smallest integer $d$ such that $Q_{d}(f)$ is not an isometric subgraph of $Q_{d}$. Ili\\'{c}, Klav\\"},"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":"1501.00378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-02T10:49:04Z","cross_cats_sorted":[],"title_canon_sha256":"8186bba9c4f34ea03f16d9ee83ae8c23ca9804814d635601762924cc61c9cc16","abstract_canon_sha256":"54292d8c9917cd13562db6faa99b5cf4a0dae4610d64b855d34109864263e9ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.343610Z","signature_b64":"h/cGit5wCb7YI4PTIdyUxThA6efzOk7f57pB6WvJtWYTg6KM2tX+t4Xh9w0+ajSklJaCGO4PRJRaCnZxZKE/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","last_reissued_at":"2026-05-18T02:30:09.342912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.342912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proofs of two conjectures on generalized Fibonacci cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Jianxin Wei","submitted_at":"2015-01-02T10:49:04Z","abstract_excerpt":"A binary string $f$ is a factor of string $u$ if $f$ appears as a sequence of $|f|$ consecutive bits of $u$, where $|f|$ denotes the length of $f$. Generalized Fibonacci cube $Q_{d}(f)$ is the graph obtained from the $d$-cube $Q_{d}$ by removing all vertices that contain a given binary string $f$ as a factor. A binary string $f$ is called good if $Q_{d}(f)$ is an isometric subgraph of $Q_{d}$ for all $d\\geq1$, it is called bad otherwise. The index of a binary string $f$, denoted by $B(f)$, is the smallest integer $d$ such that $Q_{d}(f)$ is not an isometric subgraph of $Q_{d}$. Ili\\'{c}, Klav\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00378","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":"1501.00378","created_at":"2026-05-18T02:30:09.343026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00378v1","created_at":"2026-05-18T02:30:09.343026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00378","created_at":"2026-05-18T02:30:09.343026+00:00"},{"alias_kind":"pith_short_12","alias_value":"LULKP4PYZXUF","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LULKP4PYZXUFGVZN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LULKP4PY","created_at":"2026-05-18T12:29:29.992203+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/LULKP4PYZXUFGVZNYEG3DZKHQB","json":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB.json","graph_json":"https://pith.science/api/pith-number/LULKP4PYZXUFGVZNYEG3DZKHQB/graph.json","events_json":"https://pith.science/api/pith-number/LULKP4PYZXUFGVZNYEG3DZKHQB/events.json","paper":"https://pith.science/paper/LULKP4PY"},"agent_actions":{"view_html":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB","download_json":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB.json","view_paper":"https://pith.science/paper/LULKP4PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00378&json=true","fetch_graph":"https://pith.science/api/pith-number/LULKP4PYZXUFGVZNYEG3DZKHQB/graph.json","fetch_events":"https://pith.science/api/pith-number/LULKP4PYZXUFGVZNYEG3DZKHQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/action/storage_attestation","attest_author":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/action/author_attestation","sign_citation":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/action/citation_signature","submit_replication":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/action/replication_record"}},"created_at":"2026-05-18T02:30:09.343026+00:00","updated_at":"2026-05-18T02:30:09.343026+00:00"}