{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZNJIIHQO6FMICK35Q2QZ5PFTB3","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":"55e2b72746e124aebf41d52c628eaab18b4398e17b41c303ec8a850b299429c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-21T16:02:22Z","title_canon_sha256":"fed7e18628c0349469d32440797b1053f80b0bbf9c49927a3cbe94488e7e534b"},"schema_version":"1.0","source":{"id":"1409.6002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6002","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6002v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6002","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZNJIIHQO6FMI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNJIIHQO6FMICK35","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNJIIHQO","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:fd4ea1fc9bfc33348082529390e73fe28d870e864253c5d96c6fe1ce4f44e6eb","target":"graph","created_at":"2026-05-18T02:42:13Z","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 $k\\ge 2$ be an integer and $T_1,\\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\\le i\\le k$, do not contain common edges and common vertices, except the vertices $u$ and $v$, then $T_1,\\ldots, T_k$ are completely independent spanning trees in $G$. For $2k$-regular graphs which are $2k$-connected, such as the Cartesian product of a complete graph of order $2k-1$ and a cycle and some Cartesian products of three cycles (for $k=3$), the maximum number of completely independent spanning trees contained in t","authors_text":"Benoit Darties (Le2i), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-21T16:02:22Z","title":"Completely Independent Spanning Trees in Some Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6002","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:ecce082ae2ef9cbea05dd553fed6dae12e720713b4bcf1039d02337492ade251","target":"record","created_at":"2026-05-18T02:42:13Z","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":"55e2b72746e124aebf41d52c628eaab18b4398e17b41c303ec8a850b299429c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-21T16:02:22Z","title_canon_sha256":"fed7e18628c0349469d32440797b1053f80b0bbf9c49927a3cbe94488e7e534b"},"schema_version":"1.0","source":{"id":"1409.6002","kind":"arxiv","version":1}},"canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","first_computed_at":"2026-05-18T02:42:13.946553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:13.946553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnBuNPpPjtJFhRCmyKbWfrmAmMyLqmyTyYGt8BTVdx4jzMG9dM8cRDs1v0PigFTSTU0jtJAN5Jsq7F2DT7okCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:13.946942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecce082ae2ef9cbea05dd553fed6dae12e720713b4bcf1039d02337492ade251","sha256:fd4ea1fc9bfc33348082529390e73fe28d870e864253c5d96c6fe1ce4f44e6eb"],"state_sha256":"819d1308e4068a58d26d951340da23d2d674f5345b6230cbe0cf975ddd7b9377"}