{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FFOR3I7ILI27LRP2UDAW3P6MFH","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":"3786613f92b32ea1a4edcc76a556737a8383cfe4bf7a6709b941fd3db2e41461","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T07:51:46Z","title_canon_sha256":"4195506698447e16ca1fdf0df356cd9823e5c126c089516219a63ae24f850985"},"schema_version":"1.0","source":{"id":"2502.11522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11522","created_at":"2026-07-05T10:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11522v1","created_at":"2026-07-05T10:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11522","created_at":"2026-07-05T10:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"FFOR3I7ILI27","created_at":"2026-07-05T10:15:30Z"},{"alias_kind":"pith_short_16","alias_value":"FFOR3I7ILI27LRP2","created_at":"2026-07-05T10:15:30Z"},{"alias_kind":"pith_short_8","alias_value":"FFOR3I7I","created_at":"2026-07-05T10:15:30Z"}],"graph_snapshots":[{"event_id":"sha256:604d675ef52ef1523aec49c4b5261470c73af1c69969e3f5eefd78d99238c810","target":"graph","created_at":"2026-07-05T10:15:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.11522/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jie Ma, Junqing Cai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T07:51:46Z","title":"Fan's condition for completely independent spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11522","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:6e3b13ce637ac5cf26d7043485b498c8acbe357fc3a59826e8966d73f62910b9","target":"record","created_at":"2026-07-05T10:15:30Z","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":"3786613f92b32ea1a4edcc76a556737a8383cfe4bf7a6709b941fd3db2e41461","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T07:51:46Z","title_canon_sha256":"4195506698447e16ca1fdf0df356cd9823e5c126c089516219a63ae24f850985"},"schema_version":"1.0","source":{"id":"2502.11522","kind":"arxiv","version":1}},"canonical_sha256":"295d1da3e85a35f5c5faa0c16dbfcc29f260b9ef95a8bf05f1a083d7edf2086f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"295d1da3e85a35f5c5faa0c16dbfcc29f260b9ef95a8bf05f1a083d7edf2086f","first_computed_at":"2026-07-05T10:15:30.240252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:30.240252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"peTuqQMFZeC3mumlxGN5Pd0Wioy4XTklOgc4BkmmgVJBPy0JLfDW1q1zc9+NLSTguJc4RIZ5sTk5Zuv5MVKKBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:30.240763Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e3b13ce637ac5cf26d7043485b498c8acbe357fc3a59826e8966d73f62910b9","sha256:604d675ef52ef1523aec49c4b5261470c73af1c69969e3f5eefd78d99238c810"],"state_sha256":"4098f9c43a9667b3fe73b5a35ff4dcdfb83f2cdde3e62acca257cf08677e2d91"}