{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4faa6e61abc351faedfde62c2c63893c6e65d16a4c9fd7e89b57f7c93f6c1fe4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T16:08:46Z","title_canon_sha256":"da2addc560bbe063b36be348992b3fe5aaf5a37db669881f8377e529be88bf65"},"schema_version":"1.0","source":{"id":"2607.25917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25917","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25917v1","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25917","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"Y3BGE7UD4QLS","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"Y3BGE7UD4QLSOUDG","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"Y3BGE7UD","created_at":"2026-07-29T01:26:11Z"}],"graph_snapshots":[{"event_id":"sha256:d16980d82dcf43c16dd27b8ce4f58b8dcd28f264729cefd089125f035fa6ee64","target":"graph","created_at":"2026-07-29T01:26:11Z","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/2607.25917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we prove the existence of two completely independent spanning trees in the $n$-dimensional dual-cube $F_n$, a variant of the hypercube, for every $n \\geq 5$. To this end, we use the hypercube structure of the clusters of $F_n$ to extend the construction of CIST from the $(n-1)$-dimensional hypercube to the dual-cube. In addition, we propose a recursive algorithm that builds the two trees while improving their diameters. Finally, we propose a conjecture concerning the existence of $k$ completely independent spanning trees in the dual-cube.","authors_text":"Abdallah Skender, Mohammed Lalou, Nader Mbarek, Olivier Togni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T16:08:46Z","title":"Constructing two completely independent spanning trees in the dual-cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25917","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:8b9a1647f554e47e1cd9fea381eaf0a7a95d89956598760df67d98517400255f","target":"record","created_at":"2026-07-29T01:26:11Z","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":"4faa6e61abc351faedfde62c2c63893c6e65d16a4c9fd7e89b57f7c93f6c1fe4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T16:08:46Z","title_canon_sha256":"da2addc560bbe063b36be348992b3fe5aaf5a37db669881f8377e529be88bf65"},"schema_version":"1.0","source":{"id":"2607.25917","kind":"arxiv","version":1}},"canonical_sha256":"c6c2627e83e417275066527946230e29e6830168315d4ba9251ac6d6b06732e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6c2627e83e417275066527946230e29e6830168315d4ba9251ac6d6b06732e3","first_computed_at":"2026-07-29T01:26:11.047918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:26:11.047918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AyTrun0B3iMKkO9V5t1ukPV3CgqrEahposUU/rHgdZSa1TIBRNO2Q+bGfB1vLgz0EW8gFpmH1GrWXdo06uQBw==","signature_status":"signed_v1","signed_at":"2026-07-29T01:26:11.048746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25917","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:46f46736bd4b97179f4cfda27492e4110da72446e84e2b283a2d459933d15145","sha256:8d56a7e31b5f3487e5c79a8cbd32d96757b0779f783ca468eebc9feb2166b3a7","sha256:9a3ccd9d3a107e2564dd522596f4ff638c29b40a4326ac3c01aaf297ffb1aad1"]}],"invalid_events":[],"applied_event_ids":["sha256:8b9a1647f554e47e1cd9fea381eaf0a7a95d89956598760df67d98517400255f","sha256:d16980d82dcf43c16dd27b8ce4f58b8dcd28f264729cefd089125f035fa6ee64"],"state_sha256":"cbd485820c16659fbbd69bd9cab5b94ec93662a7ba587cab3bd498363e483d07"}