{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6NFOUYM2CC3HZUTFPIZ7W5AESC","short_pith_number":"pith:6NFOUYM2","schema_version":"1.0","canonical_sha256":"f34aea619a10b67cd2657a33fb74049080b0ccfd39e88eb7cf4dd7776be93647","source":{"kind":"arxiv","id":"1812.03582","version":3},"attestation_state":"computed","paper":{"title":"Optimal cube factors of Fibonacci and matchable Lucas cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haiyuan Yao, Xu Wang, Xuxu Zhao","submitted_at":"2018-12-10T00:06:01Z","abstract_excerpt":"The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial coefficients are obtained."},"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":"1812.03582","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T00:06:01Z","cross_cats_sorted":[],"title_canon_sha256":"3505f6c006065b9a6c1c6deb06c6d42f2a904980cc150443a2e8df103dd8d468","abstract_canon_sha256":"356d8f44843a482446ab3966403e3ad2105ae888bbe3027241d863da895dd2d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:50.443729Z","signature_b64":"DhQ8Ua0vuHTdHdR7ecX0dHLuXxHxffLTXQuvWEplwKZSsCOQNLo+LAUQ0hMv8qvHRSw/AINQPj2K8xB86+T3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f34aea619a10b67cd2657a33fb74049080b0ccfd39e88eb7cf4dd7776be93647","last_reissued_at":"2026-05-17T23:49:50.443244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:50.443244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal cube factors of Fibonacci and matchable Lucas cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haiyuan Yao, Xu Wang, Xuxu Zhao","submitted_at":"2018-12-10T00:06:01Z","abstract_excerpt":"The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial coefficients are obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03582","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":""},"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":"1812.03582","created_at":"2026-05-17T23:49:50.443339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03582v3","created_at":"2026-05-17T23:49:50.443339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03582","created_at":"2026-05-17T23:49:50.443339+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NFOUYM2CC3H","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NFOUYM2CC3HZUTF","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NFOUYM2","created_at":"2026-05-18T12:32:11.075285+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/6NFOUYM2CC3HZUTFPIZ7W5AESC","json":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC.json","graph_json":"https://pith.science/api/pith-number/6NFOUYM2CC3HZUTFPIZ7W5AESC/graph.json","events_json":"https://pith.science/api/pith-number/6NFOUYM2CC3HZUTFPIZ7W5AESC/events.json","paper":"https://pith.science/paper/6NFOUYM2"},"agent_actions":{"view_html":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC","download_json":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC.json","view_paper":"https://pith.science/paper/6NFOUYM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03582&json=true","fetch_graph":"https://pith.science/api/pith-number/6NFOUYM2CC3HZUTFPIZ7W5AESC/graph.json","fetch_events":"https://pith.science/api/pith-number/6NFOUYM2CC3HZUTFPIZ7W5AESC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC/action/storage_attestation","attest_author":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC/action/author_attestation","sign_citation":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC/action/citation_signature","submit_replication":"https://pith.science/pith/6NFOUYM2CC3HZUTFPIZ7W5AESC/action/replication_record"}},"created_at":"2026-05-17T23:49:50.443339+00:00","updated_at":"2026-05-17T23:49:50.443339+00:00"}