{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KQ4TDE6OWWACQDOAHH6IIKPBMM","short_pith_number":"pith:KQ4TDE6O","schema_version":"1.0","canonical_sha256":"54393193ceb580280dc039fc8429e16303ddb21316add1d8bffcbe844fb22ad0","source":{"kind":"arxiv","id":"1312.2245","version":1},"attestation_state":"computed","paper":{"title":"Edge-disjoint spanning trees and eigenvalues of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sebastian M. Cioab\\u{a}, Wiseley Wong","submitted_at":"2013-12-08T19:20:04Z","abstract_excerpt":"Partially answering a question of Paul Seymour, we obtain a sufficient eigenvalue condition for the existence of $k$ edge-disjoint spanning trees in a regular graph, when $k\\in \\{2,3\\}$. More precisely, we show that if the second largest eigenvalue of a $d$-regular graph $G$ is less than $d-\\frac{2k-1}{d+1}$, then $G$ contains at least $k$ edge-disjoint spanning trees, when $k\\in \\{2,3\\}$. We construct examples of graphs that show our bounds are essentially best possible. We conjecture that the above statement is true for any $k<d/2$."},"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":"1312.2245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-08T19:20:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"38769035e2ea55d3eb6ce51a37d966b83587585e08eb314869020168c263acbd","abstract_canon_sha256":"ed203d795e5e30d8670847695f4de4e8313f0300fd788fbda160b3a0269f3056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.854097Z","signature_b64":"uCx4Rgg9ej6RVJ2d37eeoF7uVDTN1XOsuvpChBaBT/ZO3xDF/J++vxZAKXb9fouYdNDbmpGmNLXwGsJg9KjdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54393193ceb580280dc039fc8429e16303ddb21316add1d8bffcbe844fb22ad0","last_reissued_at":"2026-05-18T03:05:10.853510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.853510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-disjoint spanning trees and eigenvalues of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sebastian M. Cioab\\u{a}, Wiseley Wong","submitted_at":"2013-12-08T19:20:04Z","abstract_excerpt":"Partially answering a question of Paul Seymour, we obtain a sufficient eigenvalue condition for the existence of $k$ edge-disjoint spanning trees in a regular graph, when $k\\in \\{2,3\\}$. More precisely, we show that if the second largest eigenvalue of a $d$-regular graph $G$ is less than $d-\\frac{2k-1}{d+1}$, then $G$ contains at least $k$ edge-disjoint spanning trees, when $k\\in \\{2,3\\}$. We construct examples of graphs that show our bounds are essentially best possible. We conjecture that the above statement is true for any $k<d/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2245","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.2245","created_at":"2026-05-18T03:05:10.853607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2245v1","created_at":"2026-05-18T03:05:10.853607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2245","created_at":"2026-05-18T03:05:10.853607+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQ4TDE6OWWAC","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQ4TDE6OWWACQDOA","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQ4TDE6O","created_at":"2026-05-18T12:27:51.066281+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/KQ4TDE6OWWACQDOAHH6IIKPBMM","json":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM.json","graph_json":"https://pith.science/api/pith-number/KQ4TDE6OWWACQDOAHH6IIKPBMM/graph.json","events_json":"https://pith.science/api/pith-number/KQ4TDE6OWWACQDOAHH6IIKPBMM/events.json","paper":"https://pith.science/paper/KQ4TDE6O"},"agent_actions":{"view_html":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM","download_json":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM.json","view_paper":"https://pith.science/paper/KQ4TDE6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2245&json=true","fetch_graph":"https://pith.science/api/pith-number/KQ4TDE6OWWACQDOAHH6IIKPBMM/graph.json","fetch_events":"https://pith.science/api/pith-number/KQ4TDE6OWWACQDOAHH6IIKPBMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM/action/storage_attestation","attest_author":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM/action/author_attestation","sign_citation":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM/action/citation_signature","submit_replication":"https://pith.science/pith/KQ4TDE6OWWACQDOAHH6IIKPBMM/action/replication_record"}},"created_at":"2026-05-18T03:05:10.853607+00:00","updated_at":"2026-05-18T03:05:10.853607+00:00"}