{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:23R5PPPC24UHJVJ3AKRU7LPYMH","short_pith_number":"pith:23R5PPPC","schema_version":"1.0","canonical_sha256":"d6e3d7bde2d72874d53b02a34fadf861da1c599012b323c54fb641dd6ff5f01e","source":{"kind":"arxiv","id":"2501.05029","version":1},"attestation_state":"computed","paper":{"title":"An A{\\alpha}-spectral radius for the existence of {P3, P4, P5}-factors in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sizhong Zhou, Yuli Zhang","submitted_at":"2025-01-09T07:37:39Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with $n\\geq25$. A $\\{P_3,P_4,P_5\\}$-factor is a spanning subgraph $H$ of $G$ such that every component of $H$ is isomorphic to an element of $\\{P_3,P_4,P_5\\}$. Nikiforov introduced the $A_{\\alpha}$-matrix of $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$ [V. Nikiforov, Merging the $A$- and $Q$-spectral theories, Appl. Anal. Discrete Math. 11 (2017) 81--107], where $\\alpha\\in[0,1]$, $D(G)$ denotes the diagonal matrix of vertex degrees of $G$ and $A(G)$ denotes the adjacency matrix of $G$. The largest eigenvalue of $A_{\\alpha}(G)$, denoted by $\\lambda"},"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":"2501.05029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-09T07:37:39Z","cross_cats_sorted":[],"title_canon_sha256":"5b0512029b2c1889941705b7db1fa9dee883aab07f90ac3c7cf4cdaa9876bf4d","abstract_canon_sha256":"3c9ef91de0476bb277061022e29db76767c2262925a7b8b843dd467af29e2a27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:50.922308Z","signature_b64":"uFLaxXFjcUsjHcPVaddBQmoTTu0Auh/8I6zbPnqv3YQDJZJvgVkD4zNjb5VquE3j3PIBdzFAk44b0u4rEef5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6e3d7bde2d72874d53b02a34fadf861da1c599012b323c54fb641dd6ff5f01e","last_reissued_at":"2026-07-05T09:58:50.921878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:50.921878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An A{\\alpha}-spectral radius for the existence of {P3, P4, P5}-factors in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sizhong Zhou, Yuli Zhang","submitted_at":"2025-01-09T07:37:39Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with $n\\geq25$. A $\\{P_3,P_4,P_5\\}$-factor is a spanning subgraph $H$ of $G$ such that every component of $H$ is isomorphic to an element of $\\{P_3,P_4,P_5\\}$. Nikiforov introduced the $A_{\\alpha}$-matrix of $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$ [V. Nikiforov, Merging the $A$- and $Q$-spectral theories, Appl. Anal. Discrete Math. 11 (2017) 81--107], where $\\alpha\\in[0,1]$, $D(G)$ denotes the diagonal matrix of vertex degrees of $G$ and $A(G)$ denotes the adjacency matrix of $G$. The largest eigenvalue of $A_{\\alpha}(G)$, denoted by $\\lambda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05029","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/2501.05029/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":"2501.05029","created_at":"2026-07-05T09:58:50.921937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05029v1","created_at":"2026-07-05T09:58:50.921937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05029","created_at":"2026-07-05T09:58:50.921937+00:00"},{"alias_kind":"pith_short_12","alias_value":"23R5PPPC24UH","created_at":"2026-07-05T09:58:50.921937+00:00"},{"alias_kind":"pith_short_16","alias_value":"23R5PPPC24UHJVJ3","created_at":"2026-07-05T09:58:50.921937+00:00"},{"alias_kind":"pith_short_8","alias_value":"23R5PPPC","created_at":"2026-07-05T09:58:50.921937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14322","citing_title":"FedStrategist: A Meta-Learning Framework for Adaptive and Robust Aggregation in Federated Learning","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH","json":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH.json","graph_json":"https://pith.science/api/pith-number/23R5PPPC24UHJVJ3AKRU7LPYMH/graph.json","events_json":"https://pith.science/api/pith-number/23R5PPPC24UHJVJ3AKRU7LPYMH/events.json","paper":"https://pith.science/paper/23R5PPPC"},"agent_actions":{"view_html":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH","download_json":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH.json","view_paper":"https://pith.science/paper/23R5PPPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05029&json=true","fetch_graph":"https://pith.science/api/pith-number/23R5PPPC24UHJVJ3AKRU7LPYMH/graph.json","fetch_events":"https://pith.science/api/pith-number/23R5PPPC24UHJVJ3AKRU7LPYMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH/action/storage_attestation","attest_author":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH/action/author_attestation","sign_citation":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH/action/citation_signature","submit_replication":"https://pith.science/pith/23R5PPPC24UHJVJ3AKRU7LPYMH/action/replication_record"}},"created_at":"2026-07-05T09:58:50.921937+00:00","updated_at":"2026-07-05T09:58:50.921937+00:00"}