{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZNJIIHQO6FMICK35Q2QZ5PFTB3","short_pith_number":"pith:ZNJIIHQO","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"},"canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","source":{"kind":"arxiv","id":"1409.6002","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZNJIIHQO6FMICK35Q2QZ5PFTB3","target":"record","payload":{"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"},"canonical_sha256":"cb52841e0ef158812b7d86a19ebcb30ef44e66b4e7c701d3be0a2b16619542b0","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"},"source_kind":"arxiv","source_id":"1409.6002","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-05-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM5WRObyG3oceA6LZaBIhBqFi9e5i+/AAR+C2qqnMY4LVYG+F5XjNBkzsS04IIkdjOnoHVjUCzhGH4CkLO4rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:50.029654Z"},"content_sha256":"ecce082ae2ef9cbea05dd553fed6dae12e720713b4bcf1039d02337492ade251","schema_version":"1.0","event_id":"sha256:ecce082ae2ef9cbea05dd553fed6dae12e720713b4bcf1039d02337492ade251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZNJIIHQO6FMICK35Q2QZ5PFTB3","target":"graph","payload":{"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"},"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-05-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT38JskYknZGZdwzU9Qw6vxqkV1KTWmQMZ5gEyhkObe1p39vG4M7r5PCZq47Stemp4CEk4e6Wbt1z+XD2gITDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:50.030386Z"},"content_sha256":"fd4ea1fc9bfc33348082529390e73fe28d870e864253c5d96c6fe1ce4f44e6eb","schema_version":"1.0","event_id":"sha256:fd4ea1fc9bfc33348082529390e73fe28d870e864253c5d96c6fe1ce4f44e6eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/bundle.json","state_url":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/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-11T07:32:50Z","links":{"resolver":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3","bundle":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/bundle.json","state":"https://pith.science/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNJIIHQO6FMICK35Q2QZ5PFTB3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xM3+DfHNyB4zAK+vfIF39/bsshhFLHRpkm7giVihp1gdT9+DpRehs6I0nZrhTctIq5cSuBffhGQC0u/kiTODDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:32:50.037482Z","bundle_sha256":"3bc35837ad071bae4a521fab1e4827859a073e61595040a0cae643d49a76dc2d"}}