{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2ZNM2W26U57IJCZCFEXIIX5V6V","short_pith_number":"pith:2ZNM2W26","schema_version":"1.0","canonical_sha256":"d65acd5b5ea77e848b22292e845fb5f55b1525ba6a8cbbaee8e558f01d5b4d3b","source":{"kind":"arxiv","id":"2606.12827","version":1},"attestation_state":"computed","paper":{"title":"Completely Independent Spanning Trees in $k$-Outerplanar Triangulated Discs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Toru Araki","submitted_at":"2026-06-11T02:47:10Z","abstract_excerpt":"Let $T_{1}, T_{2}, \\dots, T_{k}$ be $k$ spanning trees of a graph $G$. For any pair of vertices $u$ and $v$, if the $u$--$v$ paths in the $k$ spanning trees are pairwise openly disjoint, then the spanning trees are called completely independent spanning trees (CISTs) of $G$. In this paper, we first prove that every 3-connected 2-outerplanar triangulated disc has two completely independent spanning trees. Next, for a 3-connected 3-outerplanar triangulated disc $G$, we provide sufficient conditions for $G$ to have two completely independent spanning trees. We provide an example of a 3-connected "},"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":"2606.12827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-11T02:47:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cf7ecfe158380ff032628e5281b33eb906718fdbe6d4ecd0c05c3d1f1984e137","abstract_canon_sha256":"350df3fca2358669c941661e264e7a05757305b4c1818bb65dfbbae53117c7e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:53.019402Z","signature_b64":"Z6cwjRMN+/yRe2OCrJ0FdYFVREEaW1xj4a+0m3Gw9zTz2qWaJuZbImlD0iE+Tr+AZALuWndhwk3SKa6/O0U8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d65acd5b5ea77e848b22292e845fb5f55b1525ba6a8cbbaee8e558f01d5b4d3b","last_reissued_at":"2026-06-12T01:08:53.018595Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:53.018595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely Independent Spanning Trees in $k$-Outerplanar Triangulated Discs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Toru Araki","submitted_at":"2026-06-11T02:47:10Z","abstract_excerpt":"Let $T_{1}, T_{2}, \\dots, T_{k}$ be $k$ spanning trees of a graph $G$. For any pair of vertices $u$ and $v$, if the $u$--$v$ paths in the $k$ spanning trees are pairwise openly disjoint, then the spanning trees are called completely independent spanning trees (CISTs) of $G$. In this paper, we first prove that every 3-connected 2-outerplanar triangulated disc has two completely independent spanning trees. Next, for a 3-connected 3-outerplanar triangulated disc $G$, we provide sufficient conditions for $G$ to have two completely independent spanning trees. We provide an example of a 3-connected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12827","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.12827/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.12827","created_at":"2026-06-12T01:08:53.018713+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12827v1","created_at":"2026-06-12T01:08:53.018713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12827","created_at":"2026-06-12T01:08:53.018713+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZNM2W26U57I","created_at":"2026-06-12T01:08:53.018713+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZNM2W26U57IJCZC","created_at":"2026-06-12T01:08:53.018713+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZNM2W26","created_at":"2026-06-12T01:08:53.018713+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/2ZNM2W26U57IJCZCFEXIIX5V6V","json":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V.json","graph_json":"https://pith.science/api/pith-number/2ZNM2W26U57IJCZCFEXIIX5V6V/graph.json","events_json":"https://pith.science/api/pith-number/2ZNM2W26U57IJCZCFEXIIX5V6V/events.json","paper":"https://pith.science/paper/2ZNM2W26"},"agent_actions":{"view_html":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V","download_json":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V.json","view_paper":"https://pith.science/paper/2ZNM2W26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12827&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZNM2W26U57IJCZCFEXIIX5V6V/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZNM2W26U57IJCZCFEXIIX5V6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V/action/storage_attestation","attest_author":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V/action/author_attestation","sign_citation":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V/action/citation_signature","submit_replication":"https://pith.science/pith/2ZNM2W26U57IJCZCFEXIIX5V6V/action/replication_record"}},"created_at":"2026-06-12T01:08:53.018713+00:00","updated_at":"2026-06-12T01:08:53.018713+00:00"}