{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HKLRR7FS7CD5MNHN7AUEMUNQRD","short_pith_number":"pith:HKLRR7FS","canonical_record":{"source":{"id":"2512.15486","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-17T14:36:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5e8f5a89729a15bcdc2a9bd27244fb546a1f910f68d99ab2a30604da7b5758c6","abstract_canon_sha256":"ac153be12c30813322712dbba1c54c91dd3ab7ab133de61f33bb6efc5f4580bd"},"schema_version":"1.0"},"canonical_sha256":"3a9718fcb2f887d634edf8284651b088d719f6a08ce7fb7ae9ed3c09af12eba6","source":{"kind":"arxiv","id":"2512.15486","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.15486","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.15486v2","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.15486","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"HKLRR7FS7CD5","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_16","alias_value":"HKLRR7FS7CD5MNHN","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_8","alias_value":"HKLRR7FS","created_at":"2026-07-29T01:25:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HKLRR7FS7CD5MNHN7AUEMUNQRD","target":"record","payload":{"canonical_record":{"source":{"id":"2512.15486","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-17T14:36:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5e8f5a89729a15bcdc2a9bd27244fb546a1f910f68d99ab2a30604da7b5758c6","abstract_canon_sha256":"ac153be12c30813322712dbba1c54c91dd3ab7ab133de61f33bb6efc5f4580bd"},"schema_version":"1.0"},"canonical_sha256":"3a9718fcb2f887d634edf8284651b088d719f6a08ce7fb7ae9ed3c09af12eba6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:32.248799Z","signature_b64":"WxWeK6E35JpbO/4YvQA9N2gai2L2z4vxbBIOpdy3digyU0HNquOsFd5WpZbx2RJlDwNPMEJMgzeDu6irRUPpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9718fcb2f887d634edf8284651b088d719f6a08ce7fb7ae9ed3c09af12eba6","last_reissued_at":"2026-07-29T01:25:32.247838Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:32.247838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.15486","source_version":2,"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-07-29T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDZ9pkVtdg1N6MtV1C6LWtMh6LqfDeiFrDiJrbQ7JOD/DFqt0MeP50tkgvFhY/On0+ifTUZlAnINcY7l84xEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:32:36.388757Z"},"content_sha256":"e4b761747978568dc274b114815124593f72cca7f3f7befdb835c3dabc064473","schema_version":"1.0","event_id":"sha256:e4b761747978568dc274b114815124593f72cca7f3f7befdb835c3dabc064473"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HKLRR7FS7CD5MNHN7AUEMUNQRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abdallah Skender, Mohammed Lalou, Nader Mbarek, Olivier Togni","submitted_at":"2025-12-17T14:36:24Z","abstract_excerpt":"We study completely independent spanning trees (CIST), \\textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a correspondence between the existence of CIST in a split graph and some types of hypergraph colorings (panchromatic and bipanchromatic colorings) of its associated hypergraph, allowing us to obtain lower and upper bounds on the number of CIST. Using these relations, we prove that the problem of the existence of two CIST in a split graph is NP-complete. Finally, we formulate a conjecture on the bipanchromatic number of a hypergrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.15486","kind":"arxiv","version":2},"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/2512.15486/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"},"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-07-29T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eHsRmdzGbfAcL+bxM4GCzrKMdNhR0SWwzcv4Bihvxi7xlFpfwDIyI0GXQQmw5m7t9RK3eWdTX4iTgypFN5FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:32:36.389311Z"},"content_sha256":"9d48024e43078e0889b283f0d79d48d30190426b393b71eef8af5a96bdbebeea","schema_version":"1.0","event_id":"sha256:9d48024e43078e0889b283f0d79d48d30190426b393b71eef8af5a96bdbebeea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/bundle.json","state_url":"https://pith.science/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/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-08-12T03:32:36Z","links":{"resolver":"https://pith.science/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD","bundle":"https://pith.science/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/bundle.json","state":"https://pith.science/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKLRR7FS7CD5MNHN7AUEMUNQRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HKLRR7FS7CD5MNHN7AUEMUNQRD","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":"ac153be12c30813322712dbba1c54c91dd3ab7ab133de61f33bb6efc5f4580bd","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-17T14:36:24Z","title_canon_sha256":"5e8f5a89729a15bcdc2a9bd27244fb546a1f910f68d99ab2a30604da7b5758c6"},"schema_version":"1.0","source":{"id":"2512.15486","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.15486","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.15486v2","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.15486","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"HKLRR7FS7CD5","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_16","alias_value":"HKLRR7FS7CD5MNHN","created_at":"2026-07-29T01:25:32Z"},{"alias_kind":"pith_short_8","alias_value":"HKLRR7FS","created_at":"2026-07-29T01:25:32Z"}],"graph_snapshots":[{"event_id":"sha256:9d48024e43078e0889b283f0d79d48d30190426b393b71eef8af5a96bdbebeea","target":"graph","created_at":"2026-07-29T01:25:32Z","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/2512.15486/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study completely independent spanning trees (CIST), \\textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a correspondence between the existence of CIST in a split graph and some types of hypergraph colorings (panchromatic and bipanchromatic colorings) of its associated hypergraph, allowing us to obtain lower and upper bounds on the number of CIST. Using these relations, we prove that the problem of the existence of two CIST in a split graph is NP-complete. Finally, we formulate a conjecture on the bipanchromatic number of a hypergrap","authors_text":"Abdallah Skender, Mohammed Lalou, Nader Mbarek, Olivier Togni","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-17T14:36:24Z","title":"Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.15486","kind":"arxiv","version":2},"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:e4b761747978568dc274b114815124593f72cca7f3f7befdb835c3dabc064473","target":"record","created_at":"2026-07-29T01:25:32Z","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":"ac153be12c30813322712dbba1c54c91dd3ab7ab133de61f33bb6efc5f4580bd","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-17T14:36:24Z","title_canon_sha256":"5e8f5a89729a15bcdc2a9bd27244fb546a1f910f68d99ab2a30604da7b5758c6"},"schema_version":"1.0","source":{"id":"2512.15486","kind":"arxiv","version":2}},"canonical_sha256":"3a9718fcb2f887d634edf8284651b088d719f6a08ce7fb7ae9ed3c09af12eba6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a9718fcb2f887d634edf8284651b088d719f6a08ce7fb7ae9ed3c09af12eba6","first_computed_at":"2026-07-29T01:25:32.247838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:25:32.247838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WxWeK6E35JpbO/4YvQA9N2gai2L2z4vxbBIOpdy3digyU0HNquOsFd5WpZbx2RJlDwNPMEJMgzeDu6irRUPpCQ==","signature_status":"signed_v1","signed_at":"2026-07-29T01:25:32.248799Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.15486","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4b761747978568dc274b114815124593f72cca7f3f7befdb835c3dabc064473","sha256:9d48024e43078e0889b283f0d79d48d30190426b393b71eef8af5a96bdbebeea"],"state_sha256":"7b942916a51f98bbfc0b5cc30f27614717f4d1a0c123030ea82f95d633d738db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEB6oUC8JLMagv3biPaP18/7duCZ2qiCJe2BbOZMyE+xhE4hdgA4WzRdHij0k087tirjv32W6ZN938ZbLwopCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T03:32:36.394279Z","bundle_sha256":"8d93f40c776edbbf85705fa51cf1343375af2125b432ec62408e4fe58b737286"}}