{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AQ4AOPDSUYMLUSUGTKXO7HVRJQ","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":"06e89f6a4f7d5c9bb143659399d9beba52c6de6dc6d43e90c78accee0f4aab48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-20T03:38:06Z","title_canon_sha256":"095c6d8b2168b41b906b82df10b7b562ae97279b25c775ff6d43e7d76b426b21"},"schema_version":"1.0","source":{"id":"1704.05994","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05994","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05994v3","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05994","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"AQ4AOPDSUYML","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AQ4AOPDSUYMLUSUG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AQ4AOPDS","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:c23aaaf86c7939f628155ee2dd6686025c0c44d1a482a7467be02446c0f860ec","target":"graph","created_at":"2026-05-18T00:00:35Z","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"},"paper":{"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)$","authors_text":"Cunxiang Duan, Ligong Wang, Xiangxiang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-20T03:38:06Z","title":"Edge Connectivity, Packing Spanning Trees, and Eigenvalues of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05994","kind":"arxiv","version":3},"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:12ca7615e6c4bcf11257392f17ff3917fcb1da167dae3eade54d07c25e95d672","target":"record","created_at":"2026-05-18T00:00:35Z","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":"06e89f6a4f7d5c9bb143659399d9beba52c6de6dc6d43e90c78accee0f4aab48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-20T03:38:06Z","title_canon_sha256":"095c6d8b2168b41b906b82df10b7b562ae97279b25c775ff6d43e7d76b426b21"},"schema_version":"1.0","source":{"id":"1704.05994","kind":"arxiv","version":3}},"canonical_sha256":"0438073c72a618ba4a869aaeef9eb14c23b7b2e4c56dd373515e11f5f5f2c100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0438073c72a618ba4a869aaeef9eb14c23b7b2e4c56dd373515e11f5f5f2c100","first_computed_at":"2026-05-18T00:00:35.585913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:35.585913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wHl+8fS0IR1sVILqWxZPGt0YDi+4orQjQB2NiarShf/u4et8cTSYo3ewO1OYr+Kxa4XlCC/18pkOdFfhOd5cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:35.586390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05994","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ca7615e6c4bcf11257392f17ff3917fcb1da167dae3eade54d07c25e95d672","sha256:c23aaaf86c7939f628155ee2dd6686025c0c44d1a482a7467be02446c0f860ec"],"state_sha256":"a6c6228cdc1c04dbc12749eaf51477ff0cd21119680d1f5e96f9d03872ddd1f6"}