{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7UVWZJBBFGMCHO3T2IY4BEGZ3D","short_pith_number":"pith:7UVWZJBB","canonical_record":{"source":{"id":"2508.05678","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T12:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"a07924d735dad684377e67f203fa5a3537e42961d91469a1ca88acdb1af0c9fe","abstract_canon_sha256":"949fe734c1744d4846c6cd73a5a86993344f0220bc2dfba391e76f3d8c174076"},"schema_version":"1.0"},"canonical_sha256":"fd2b6ca421299823bb73d231c090d9d8dabe7656520a6ea0fb8d9f693e8db639","source":{"kind":"arxiv","id":"2508.05678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05678","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05678v1","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05678","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"7UVWZJBBFGMC","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_16","alias_value":"7UVWZJBBFGMCHO3T","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_8","alias_value":"7UVWZJBB","created_at":"2026-07-05T11:50:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7UVWZJBBFGMCHO3T2IY4BEGZ3D","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05678","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T12:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"a07924d735dad684377e67f203fa5a3537e42961d91469a1ca88acdb1af0c9fe","abstract_canon_sha256":"949fe734c1744d4846c6cd73a5a86993344f0220bc2dfba391e76f3d8c174076"},"schema_version":"1.0"},"canonical_sha256":"fd2b6ca421299823bb73d231c090d9d8dabe7656520a6ea0fb8d9f693e8db639","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:41.411591Z","signature_b64":"2m5/37/etJ4SbhRH01gK9hqJ3Jw9QX+jeIjBjW/gCHgwxTSjTMvkZc0XTUhet1vEo62DQGKN7UbhPsKFBGP4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2b6ca421299823bb73d231c090d9d8dabe7656520a6ea0fb8d9f693e8db639","last_reissued_at":"2026-07-05T11:50:41.411089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:41.411089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05678","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-07-05T11:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIXlcl6yuOnFlMEDPHC+f88T/hgc+d6vfNsjmTTiqKCVTfcxhZ/y7PzKFwdyPr4wy/c7rV/fKNttMFgLpUkwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:09:53.372750Z"},"content_sha256":"cc856fc80bdff051ddbb47ea43879e11295f87dcbfc8be69d0cdb0a26cfc0772","schema_version":"1.0","event_id":"sha256:cc856fc80bdff051ddbb47ea43879e11295f87dcbfc8be69d0cdb0a26cfc0772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7UVWZJBBFGMCHO3T2IY4BEGZ3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral conditions for graphs to contain $k$-factors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenqian Zhang, Xinying Tang","submitted_at":"2025-08-05T12:54:36Z","abstract_excerpt":"Let $G$ be a graph. The spectral radius $\\rho(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. For an integer $k\\geq1$, a $k$-factor of $G$ is a $k$-regular spanning subgraph of $G$. Assume that $k$ and $n$ are integers satisfying $k\\geq2,kn\\equiv0~(\\mod2)$ and $n\\geq\\max\\left\\{k^{2}+6k+7,20k+10\\right\\}$. Let $G$ be a graph of order $n$ and with minimum degree at least $k$. In this paper, we give a sharp lower bound of $\\rho(G)$ to guarantee that $G$ contains a $k$-factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05678","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.05678/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"},"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-07-05T11:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+CJayqB5rAlvyi8stuf9zsQn400oReSzM4x0YJJ19gUPKDHGs2m2vNaIvLwzNTtxykEyOzsdy01eGFVB5JhxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:09:53.373255Z"},"content_sha256":"6e93f006c9d9a9e3d5714b542245a69bb8d941a543e6cc3b35b6ad16403ea62f","schema_version":"1.0","event_id":"sha256:6e93f006c9d9a9e3d5714b542245a69bb8d941a543e6cc3b35b6ad16403ea62f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/bundle.json","state_url":"https://pith.science/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/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-08-13T12:09:53Z","links":{"resolver":"https://pith.science/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D","bundle":"https://pith.science/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/bundle.json","state":"https://pith.science/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UVWZJBBFGMCHO3T2IY4BEGZ3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7UVWZJBBFGMCHO3T2IY4BEGZ3D","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":"949fe734c1744d4846c6cd73a5a86993344f0220bc2dfba391e76f3d8c174076","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T12:54:36Z","title_canon_sha256":"a07924d735dad684377e67f203fa5a3537e42961d91469a1ca88acdb1af0c9fe"},"schema_version":"1.0","source":{"id":"2508.05678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05678","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05678v1","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05678","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"7UVWZJBBFGMC","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_16","alias_value":"7UVWZJBBFGMCHO3T","created_at":"2026-07-05T11:50:41Z"},{"alias_kind":"pith_short_8","alias_value":"7UVWZJBB","created_at":"2026-07-05T11:50:41Z"}],"graph_snapshots":[{"event_id":"sha256:6e93f006c9d9a9e3d5714b542245a69bb8d941a543e6cc3b35b6ad16403ea62f","target":"graph","created_at":"2026-07-05T11:50:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.05678/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph. The spectral radius $\\rho(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. For an integer $k\\geq1$, a $k$-factor of $G$ is a $k$-regular spanning subgraph of $G$. Assume that $k$ and $n$ are integers satisfying $k\\geq2,kn\\equiv0~(\\mod2)$ and $n\\geq\\max\\left\\{k^{2}+6k+7,20k+10\\right\\}$. Let $G$ be a graph of order $n$ and with minimum degree at least $k$. In this paper, we give a sharp lower bound of $\\rho(G)$ to guarantee that $G$ contains a $k$-factor.","authors_text":"Wenqian Zhang, Xinying Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T12:54:36Z","title":"Spectral conditions for graphs to contain $k$-factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05678","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:cc856fc80bdff051ddbb47ea43879e11295f87dcbfc8be69d0cdb0a26cfc0772","target":"record","created_at":"2026-07-05T11:50:41Z","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":"949fe734c1744d4846c6cd73a5a86993344f0220bc2dfba391e76f3d8c174076","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T12:54:36Z","title_canon_sha256":"a07924d735dad684377e67f203fa5a3537e42961d91469a1ca88acdb1af0c9fe"},"schema_version":"1.0","source":{"id":"2508.05678","kind":"arxiv","version":1}},"canonical_sha256":"fd2b6ca421299823bb73d231c090d9d8dabe7656520a6ea0fb8d9f693e8db639","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd2b6ca421299823bb73d231c090d9d8dabe7656520a6ea0fb8d9f693e8db639","first_computed_at":"2026-07-05T11:50:41.411089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:41.411089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2m5/37/etJ4SbhRH01gK9hqJ3Jw9QX+jeIjBjW/gCHgwxTSjTMvkZc0XTUhet1vEo62DQGKN7UbhPsKFBGP4BA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:41.411591Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc856fc80bdff051ddbb47ea43879e11295f87dcbfc8be69d0cdb0a26cfc0772","sha256:6e93f006c9d9a9e3d5714b542245a69bb8d941a543e6cc3b35b6ad16403ea62f"],"state_sha256":"0422d48e0c497c2f2c15652a53613df79e8d3eb9c38803556adc1c6795eb0737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGyiqBMlS/9qA7K0iUR9dLWURPhq2YzwG26xgEVBHo1Mph35iUlNdAQgQoYHeZc1L0gIKguZI+qeyKSd7siVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T12:09:53.376859Z","bundle_sha256":"bddf80451ba8a23a9567d7f591e362afa3e98524d0560a654e245652f69cdd68"}}