{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LULKP4PYZXUFGVZNYEG3DZKHQB","short_pith_number":"pith:LULKP4PY","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"},"canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","source":{"kind":"arxiv","id":"1501.00378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00378","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00378v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00378","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"LULKP4PYZXUF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LULKP4PYZXUFGVZN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LULKP4PY","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LULKP4PYZXUFGVZNYEG3DZKHQB","target":"record","payload":{"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"},"canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","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"},"source_kind":"arxiv","source_id":"1501.00378","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mrv4zhPeG3wVLlRDjkNIG9CRfuT1CJJ10ysXKZuO0hI+WtVg9iYeCpwg/hOc9h/mj7XgOdfNp2n1TcoGsWn9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:43:24.450906Z"},"content_sha256":"38e2b5574abfa3194bc4f7191595e7aebbbf8d63c58c92e67ae810c3d4df84f8","schema_version":"1.0","event_id":"sha256:38e2b5574abfa3194bc4f7191595e7aebbbf8d63c58c92e67ae810c3d4df84f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LULKP4PYZXUFGVZNYEG3DZKHQB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NY8f7y8eGb729fQqk34wvYguVgyhylQxjtkIbi5JBl6UjotAbmpVUmOftpjiFqk4BGgWsPw3Rm0gqhxqnQJqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:43:24.451248Z"},"content_sha256":"be281275b553165b0061f5d569381ef933c6c98a6dc1ffe6d271032fbd79fc57","schema_version":"1.0","event_id":"sha256:be281275b553165b0061f5d569381ef933c6c98a6dc1ffe6d271032fbd79fc57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/bundle.json","state_url":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T08:43:24Z","links":{"resolver":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB","bundle":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/bundle.json","state":"https://pith.science/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LULKP4PYZXUFGVZNYEG3DZKHQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LULKP4PYZXUFGVZNYEG3DZKHQB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54292d8c9917cd13562db6faa99b5cf4a0dae4610d64b855d34109864263e9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-02T10:49:04Z","title_canon_sha256":"8186bba9c4f34ea03f16d9ee83ae8c23ca9804814d635601762924cc61c9cc16"},"schema_version":"1.0","source":{"id":"1501.00378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00378","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00378v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00378","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"LULKP4PYZXUF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LULKP4PYZXUFGVZN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LULKP4PY","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:be281275b553165b0061f5d569381ef933c6c98a6dc1ffe6d271032fbd79fc57","target":"graph","created_at":"2026-05-18T02:30:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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\\","authors_text":"Heping Zhang, Jianxin Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-02T10:49:04Z","title":"Proofs of two conjectures on generalized Fibonacci cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00378","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:38e2b5574abfa3194bc4f7191595e7aebbbf8d63c58c92e67ae810c3d4df84f8","target":"record","created_at":"2026-05-18T02:30:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"54292d8c9917cd13562db6faa99b5cf4a0dae4610d64b855d34109864263e9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-02T10:49:04Z","title_canon_sha256":"8186bba9c4f34ea03f16d9ee83ae8c23ca9804814d635601762924cc61c9cc16"},"schema_version":"1.0","source":{"id":"1501.00378","kind":"arxiv","version":1}},"canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d16a7f1f8cde853572dc10db1e5478050b6247e4e5d593c77c71b01323b267c","first_computed_at":"2026-05-18T02:30:09.342912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:09.342912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/cGit5wCb7YI4PTIdyUxThA6efzOk7f57pB6WvJtWYTg6KM2tX+t4Xh9w0+ajSklJaCGO4PRJRaCnZxZKE/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:09.343610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38e2b5574abfa3194bc4f7191595e7aebbbf8d63c58c92e67ae810c3d4df84f8","sha256:be281275b553165b0061f5d569381ef933c6c98a6dc1ffe6d271032fbd79fc57"],"state_sha256":"1f677d05dcf03e4536d388207355a94b25fa57ba51294711566956775b7c9011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzBToTGcVoouBe4TBXXlyd+21hWd5olz9pHhsHKMJsoQwe7Ta1b1Z2BLY7K3dGvv63ALHTBHQtB829q/tol1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:43:24.453120Z","bundle_sha256":"ceb82de3b904bfea7393f5d7f3b3d5d67eb84fe629facb983244ff95d9522728"}}