{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:63EOZ3EQ3O6LOXP6KMB3MVGKFJ","short_pith_number":"pith:63EOZ3EQ","schema_version":"1.0","canonical_sha256":"f6c8ecec90dbbcb75dfe5303b654ca2a650064e218164ccccdb6c4ffca492c78","source":{"kind":"arxiv","id":"2605.23737","version":1},"attestation_state":"computed","paper":{"title":"Spectral radius and edge-disjoint connected factors of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenqian Zhang, Xinying Tang","submitted_at":"2026-05-22T15:13:35Z","abstract_excerpt":"For a graph $G$, the spectral radius of $G$ is the largest eigenvalue of its adjacency matrix. A connected factor of $G$ is a connected spanning subgraph of $G$. For example, a spanning tree of $G$ is a 1-connected factor of $G$. Let $G$ be a graph of order $n$ with minimum degree $\\delta\\geq6$, where $n\\geq3\\delta$. In this paper, we give a sharp spectral radius condition for $G$ to contain $k$ edge-disjoint 2-connected factors and $\\left\\lfloor\\frac{\\delta-4k}{2}\\right\\rfloor$ edge-disjoint spanning trees, where $1\\leq k\\leq\\left\\lfloor\\frac{\\delta}{4}\\right\\rfloor$ is an integer."},"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":"2605.23737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T15:13:35Z","cross_cats_sorted":[],"title_canon_sha256":"6951e8c3650cc8298c25c2c10299ebec9e2e9a9d4d7156217543e4782ef8ecd5","abstract_canon_sha256":"ef9863dad6c1b64f0e682cab296ddb3d10487ed2328dcf680ebd3adc9266ee8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:29.257046Z","signature_b64":"7ImXzaMreTSkSU1bl4s47H7D2mt2I5/dS6U7Mwqdbuei9Q5aRu6g4xigQZxYu3rjD9vG7Bxhp0DlIgMxU0sxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c8ecec90dbbcb75dfe5303b654ca2a650064e218164ccccdb6c4ffca492c78","last_reissued_at":"2026-05-25T02:02:29.256268Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:29.256268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral radius and edge-disjoint connected factors of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenqian Zhang, Xinying Tang","submitted_at":"2026-05-22T15:13:35Z","abstract_excerpt":"For a graph $G$, the spectral radius of $G$ is the largest eigenvalue of its adjacency matrix. A connected factor of $G$ is a connected spanning subgraph of $G$. For example, a spanning tree of $G$ is a 1-connected factor of $G$. Let $G$ be a graph of order $n$ with minimum degree $\\delta\\geq6$, where $n\\geq3\\delta$. In this paper, we give a sharp spectral radius condition for $G$ to contain $k$ edge-disjoint 2-connected factors and $\\left\\lfloor\\frac{\\delta-4k}{2}\\right\\rfloor$ edge-disjoint spanning trees, where $1\\leq k\\leq\\left\\lfloor\\frac{\\delta}{4}\\right\\rfloor$ is an integer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23737","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/2605.23737/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":"2605.23737","created_at":"2026-05-25T02:02:29.256414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23737v1","created_at":"2026-05-25T02:02:29.256414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23737","created_at":"2026-05-25T02:02:29.256414+00:00"},{"alias_kind":"pith_short_12","alias_value":"63EOZ3EQ3O6L","created_at":"2026-05-25T02:02:29.256414+00:00"},{"alias_kind":"pith_short_16","alias_value":"63EOZ3EQ3O6LOXP6","created_at":"2026-05-25T02:02:29.256414+00:00"},{"alias_kind":"pith_short_8","alias_value":"63EOZ3EQ","created_at":"2026-05-25T02:02:29.256414+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/63EOZ3EQ3O6LOXP6KMB3MVGKFJ","json":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ.json","graph_json":"https://pith.science/api/pith-number/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/graph.json","events_json":"https://pith.science/api/pith-number/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/events.json","paper":"https://pith.science/paper/63EOZ3EQ"},"agent_actions":{"view_html":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ","download_json":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ.json","view_paper":"https://pith.science/paper/63EOZ3EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23737&json=true","fetch_graph":"https://pith.science/api/pith-number/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/action/storage_attestation","attest_author":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/action/author_attestation","sign_citation":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/action/citation_signature","submit_replication":"https://pith.science/pith/63EOZ3EQ3O6LOXP6KMB3MVGKFJ/action/replication_record"}},"created_at":"2026-05-25T02:02:29.256414+00:00","updated_at":"2026-05-25T02:02:29.256414+00:00"}