{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FFOR3I7ILI27LRP2UDAW3P6MFH","short_pith_number":"pith:FFOR3I7I","schema_version":"1.0","canonical_sha256":"295d1da3e85a35f5c5faa0c16dbfcc29f260b9ef95a8bf05f1a083d7edf2086f","source":{"kind":"arxiv","id":"2502.11522","version":1},"attestation_state":"computed","paper":{"title":"Fan's condition for completely independent spanning trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Junqing Cai","submitted_at":"2025-02-17T07:51:46Z","abstract_excerpt":"Spanning trees $T_1,T_2, \\dots,T_k$ of $G$ are $k$ completely independent spanning trees if, for any two vertices $u,v\\in V(G)$, the paths from $u$ to $v$ in these $k$ trees are pairwise edge-disjoint and internal vertex-disjoint. Hasunuma proved that determining whether a graph contains $k$ completely independent spanning trees is NP-complete, even for $k = 2$. Araki posed the question of whether certain known sufficient conditions for hamiltonian cycles are also also guarantee two completely independent spanning trees? In this paper, we affirmatively answer this question for the Fan-type con"},"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":"2502.11522","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T07:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"4195506698447e16ca1fdf0df356cd9823e5c126c089516219a63ae24f850985","abstract_canon_sha256":"3786613f92b32ea1a4edcc76a556737a8383cfe4bf7a6709b941fd3db2e41461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:30.240763Z","signature_b64":"peTuqQMFZeC3mumlxGN5Pd0Wioy4XTklOgc4BkmmgVJBPy0JLfDW1q1zc9+NLSTguJc4RIZ5sTk5Zuv5MVKKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"295d1da3e85a35f5c5faa0c16dbfcc29f260b9ef95a8bf05f1a083d7edf2086f","last_reissued_at":"2026-07-05T10:15:30.240252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:30.240252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fan's condition for completely independent spanning trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Junqing Cai","submitted_at":"2025-02-17T07:51:46Z","abstract_excerpt":"Spanning trees $T_1,T_2, \\dots,T_k$ of $G$ are $k$ completely independent spanning trees if, for any two vertices $u,v\\in V(G)$, the paths from $u$ to $v$ in these $k$ trees are pairwise edge-disjoint and internal vertex-disjoint. Hasunuma proved that determining whether a graph contains $k$ completely independent spanning trees is NP-complete, even for $k = 2$. Araki posed the question of whether certain known sufficient conditions for hamiltonian cycles are also also guarantee two completely independent spanning trees? In this paper, we affirmatively answer this question for the Fan-type con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11522","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/2502.11522/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":"2502.11522","created_at":"2026-07-05T10:15:30.240321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11522v1","created_at":"2026-07-05T10:15:30.240321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11522","created_at":"2026-07-05T10:15:30.240321+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFOR3I7ILI27","created_at":"2026-07-05T10:15:30.240321+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFOR3I7ILI27LRP2","created_at":"2026-07-05T10:15:30.240321+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFOR3I7I","created_at":"2026-07-05T10:15:30.240321+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/FFOR3I7ILI27LRP2UDAW3P6MFH","json":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH.json","graph_json":"https://pith.science/api/pith-number/FFOR3I7ILI27LRP2UDAW3P6MFH/graph.json","events_json":"https://pith.science/api/pith-number/FFOR3I7ILI27LRP2UDAW3P6MFH/events.json","paper":"https://pith.science/paper/FFOR3I7I"},"agent_actions":{"view_html":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH","download_json":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH.json","view_paper":"https://pith.science/paper/FFOR3I7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11522&json=true","fetch_graph":"https://pith.science/api/pith-number/FFOR3I7ILI27LRP2UDAW3P6MFH/graph.json","fetch_events":"https://pith.science/api/pith-number/FFOR3I7ILI27LRP2UDAW3P6MFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH/action/storage_attestation","attest_author":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH/action/author_attestation","sign_citation":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH/action/citation_signature","submit_replication":"https://pith.science/pith/FFOR3I7ILI27LRP2UDAW3P6MFH/action/replication_record"}},"created_at":"2026-07-05T10:15:30.240321+00:00","updated_at":"2026-07-05T10:15:30.240321+00:00"}