{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZNJIIHQO6FMICK35Q2QZ5PFTB3","short_pith_number":"pith:ZNJIIHQO","schema_version":"1.0","canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","source":{"kind":"arxiv","id":"1409.6002","version":1},"attestation_state":"computed","paper":{"title":"Completely Independent Spanning Trees in Some Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Benoit Darties (Le2i), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)","submitted_at":"2014-09-21T16:02:22Z","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"},"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":"1409.6002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-21T16:02:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fed7e18628c0349469d32440797b1053f80b0bbf9c49927a3cbe94488e7e534b","abstract_canon_sha256":"55e2b72746e124aebf41d52c628eaab18b4398e17b41c303ec8a850b299429c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.946942Z","signature_b64":"FnBuNPpPjtJFhRCmyKbWfrmAmMyLqmyTyYGt8BTVdx4jzMG9dM8cRDs1v0PigFTSTU0jtJAN5Jsq7F2DT7okCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","last_reissued_at":"2026-05-18T02:42:13.946553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.946553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely Independent Spanning Trees in Some Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Benoit Darties (Le2i), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)","submitted_at":"2014-09-21T16:02:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6002","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":"1409.6002","created_at":"2026-05-18T02:42:13.946610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6002v1","created_at":"2026-05-18T02:42:13.946610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6002","created_at":"2026-05-18T02:42:13.946610+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNJIIHQO6FMI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNJIIHQO6FMICK35","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNJIIHQO","created_at":"2026-05-18T12:28:59.999130+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/ZNJIIHQO6FMICK35Q2QZ5PFTB3","json":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3.json","graph_json":"https://pith.science/api/pith-number/ZNJIIHQO6FMICK35Q2QZ5PFTB3/graph.json","events_json":"https://pith.science/api/pith-number/ZNJIIHQO6FMICK35Q2QZ5PFTB3/events.json","paper":"https://pith.science/paper/ZNJIIHQO"},"agent_actions":{"view_html":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3","download_json":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3.json","view_paper":"https://pith.science/paper/ZNJIIHQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6002&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNJIIHQO6FMICK35Q2QZ5PFTB3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNJIIHQO6FMICK35Q2QZ5PFTB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/action/storage_attestation","attest_author":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/action/author_attestation","sign_citation":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/action/citation_signature","submit_replication":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/action/replication_record"}},"created_at":"2026-05-18T02:42:13.946610+00:00","updated_at":"2026-05-18T02:42:13.946610+00:00"}