{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AQ4AOPDSUYMLUSUGTKXO7HVRJQ","short_pith_number":"pith:AQ4AOPDS","schema_version":"1.0","canonical_sha256":"0438073c72a618ba4a869aaeef9eb14c23b7b2e4c56dd373515e11f5f5f2c100","source":{"kind":"arxiv","id":"1704.05994","version":3},"attestation_state":"computed","paper":{"title":"Edge Connectivity, Packing Spanning Trees, and Eigenvalues of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cunxiang Duan, Ligong Wang, Xiangxiang Liu","submitted_at":"2017-04-20T03:38:06Z","abstract_excerpt":"Let $\\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \\in \\mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\\subseteq V(G)$ satisfying $V(G)\\setminus(V_{1} \\cup V_{2})\\neq \\phi$ and edge connectivity $\\kappa'(G)=e(V_{i},V(G)\\backslash V_{i})$ for $1\\leq i \\leq 2$. A multigraph is a graph with possible multiple edges, but no loops. Let $\\tau(G)$ be the maximum number of edge-disjoint spanning trees of a graph $G$. Motivated by a question of Seymour on the relationship between eigenvalues of a graph $G$ and bounds of $\\tau(G)$"},"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":"1704.05994","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-20T03:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"095c6d8b2168b41b906b82df10b7b562ae97279b25c775ff6d43e7d76b426b21","abstract_canon_sha256":"06e89f6a4f7d5c9bb143659399d9beba52c6de6dc6d43e90c78accee0f4aab48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:35.586390Z","signature_b64":"wHl+8fS0IR1sVILqWxZPGt0YDi+4orQjQB2NiarShf/u4et8cTSYo3ewO1OYr+Kxa4XlCC/18pkOdFfhOd5cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0438073c72a618ba4a869aaeef9eb14c23b7b2e4c56dd373515e11f5f5f2c100","last_reissued_at":"2026-05-18T00:00:35.585913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:35.585913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Connectivity, Packing Spanning Trees, and Eigenvalues of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cunxiang Duan, Ligong Wang, Xiangxiang Liu","submitted_at":"2017-04-20T03:38:06Z","abstract_excerpt":"Let $\\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \\in \\mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\\subseteq V(G)$ satisfying $V(G)\\setminus(V_{1} \\cup V_{2})\\neq \\phi$ and edge connectivity $\\kappa'(G)=e(V_{i},V(G)\\backslash V_{i})$ for $1\\leq i \\leq 2$. A multigraph is a graph with possible multiple edges, but no loops. Let $\\tau(G)$ be the maximum number of edge-disjoint spanning trees of a graph $G$. Motivated by a question of Seymour on the relationship between eigenvalues of a graph $G$ and bounds of $\\tau(G)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05994","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":"1704.05994","created_at":"2026-05-18T00:00:35.585984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05994v3","created_at":"2026-05-18T00:00:35.585984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05994","created_at":"2026-05-18T00:00:35.585984+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ4AOPDSUYML","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ4AOPDSUYMLUSUG","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ4AOPDS","created_at":"2026-05-18T12:31:05.417338+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/AQ4AOPDSUYMLUSUGTKXO7HVRJQ","json":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ.json","graph_json":"https://pith.science/api/pith-number/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/graph.json","events_json":"https://pith.science/api/pith-number/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/events.json","paper":"https://pith.science/paper/AQ4AOPDS"},"agent_actions":{"view_html":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ","download_json":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ.json","view_paper":"https://pith.science/paper/AQ4AOPDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05994&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/action/storage_attestation","attest_author":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/action/author_attestation","sign_citation":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/action/citation_signature","submit_replication":"https://pith.science/pith/AQ4AOPDSUYMLUSUGTKXO7HVRJQ/action/replication_record"}},"created_at":"2026-05-18T00:00:35.585984+00:00","updated_at":"2026-05-18T00:00:35.585984+00:00"}