{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Z4LZLQG2NXSCVABBLQXQICPUAY","short_pith_number":"pith:Z4LZLQG2","canonical_record":{"source":{"id":"2606.28198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516","abstract_canon_sha256":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f"},"schema_version":"1.0"},"canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","source":{"kind":"arxiv","id":"2606.28198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28198v1","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"Z4LZLQG2NXSC","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z4LZLQG2NXSCVABB","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z4LZLQG2","created_at":"2026-06-29T01:15:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Z4LZLQG2NXSCVABBLQXQICPUAY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516","abstract_canon_sha256":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f"},"schema_version":"1.0"},"canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:09.017640Z","signature_b64":"ycug+4WpaO62X0ZxDJk7XfEWuDGzH1o8ll8ISoAlpQbh8DFrhwkpLpNS1oNcl7FiNFUAf+DhpvVaKxnOELFqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","last_reissued_at":"2026-06-29T01:15:09.016143Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:09.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28198","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya/+DkV57XfmMYx2ZWGsnjIdjvj3UMRHlZatayu+r/t3Hv5UbLomt9Zf0s9opFj1+OopcRH64iGtTQLbIO0WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:42:31.605739Z"},"content_sha256":"804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e","schema_version":"1.0","event_id":"sha256:804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Z4LZLQG2NXSCVABBLQXQICPUAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal graphs with no subgraph admitting $k+1$ edge-disjoint spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qinglin Wang, Yingzhi Tian","submitted_at":"2026-06-26T15:48:16Z","abstract_excerpt":"A graph $G$ is $\\tau_k$-maximal if $G$ contains no subgraph admitting $k+1$ edge-disjoint spanning trees, while the addition of any edge in the complement of $G$ yields a subgraph that admits $k+1$ edge-disjoint spanning trees. In this paper, we prove that for any integers $k\\geq 1$ and $n\\geq 2k+2$, every $\\tau_k$-maximal graph of order $n$ satisfies $|E(G)|\\leq (k+1)(n-1)-1$. Furthermore, we construct a family of $\\tau_k$-maximal graphs on $n\\ge 2k+2$ vertices that have exactly $(k+1)(n-1)-1$ edges, which establishes the tightness of the upper bound. Then we conjecture that every $\\tau_k$-ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28198","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/2606.28198/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iS0mAXHQb+ZhTEvGD3c+qrY3ure3kxWZegAhMkP7hUcS4BCopeH0UkVBTGFzaXA2gK4xuEApmwFp7LUcfmRBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:42:31.606107Z"},"content_sha256":"242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2","schema_version":"1.0","event_id":"sha256:242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/bundle.json","state_url":"https://pith.science/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T19:42:31Z","links":{"resolver":"https://pith.science/pith/Z4LZLQG2NXSCVABBLQXQICPUAY","bundle":"https://pith.science/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/bundle.json","state":"https://pith.science/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4LZLQG2NXSCVABBLQXQICPUAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z4LZLQG2NXSCVABBLQXQICPUAY","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":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516"},"schema_version":"1.0","source":{"id":"2606.28198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28198v1","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"Z4LZLQG2NXSC","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z4LZLQG2NXSCVABB","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z4LZLQG2","created_at":"2026-06-29T01:15:09Z"}],"graph_snapshots":[{"event_id":"sha256:242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2","target":"graph","created_at":"2026-06-29T01:15:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28198/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is $\\tau_k$-maximal if $G$ contains no subgraph admitting $k+1$ edge-disjoint spanning trees, while the addition of any edge in the complement of $G$ yields a subgraph that admits $k+1$ edge-disjoint spanning trees. In this paper, we prove that for any integers $k\\geq 1$ and $n\\geq 2k+2$, every $\\tau_k$-maximal graph of order $n$ satisfies $|E(G)|\\leq (k+1)(n-1)-1$. Furthermore, we construct a family of $\\tau_k$-maximal graphs on $n\\ge 2k+2$ vertices that have exactly $(k+1)(n-1)-1$ edges, which establishes the tightness of the upper bound. Then we conjecture that every $\\tau_k$-ma","authors_text":"Qinglin Wang, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title":"Extremal graphs with no subgraph admitting $k+1$ edge-disjoint spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28198","kind":"arxiv","version":1},"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:804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e","target":"record","created_at":"2026-06-29T01:15:09Z","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":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516"},"schema_version":"1.0","source":{"id":"2606.28198","kind":"arxiv","version":1}},"canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","first_computed_at":"2026-06-29T01:15:09.016143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:15:09.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycug+4WpaO62X0ZxDJk7XfEWuDGzH1o8ll8ISoAlpQbh8DFrhwkpLpNS1oNcl7FiNFUAf+DhpvVaKxnOELFqAg==","signature_status":"signed_v1","signed_at":"2026-06-29T01:15:09.017640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e","sha256:242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2"],"state_sha256":"5422c487f8a8e0678797b9be5610626a4144206a41f6963da1b40996f26135d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICweCPDKCKHRIDdQKtQsUTCDYyrQGUyxefpQk42S3RYkWj+eT33vyUOPOqowBAs8R6CPX972WnWbpiXbkDB/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:42:31.608034Z","bundle_sha256":"1b635a39d215f56cf9ed74b09288b8e570b910ecae6d68e2d6152877d7abf451"}}