{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3KWMAEAA4Q3WHJFDPD42JOSCF4","short_pith_number":"pith:3KWMAEAA","schema_version":"1.0","canonical_sha256":"daacc01000e43763a4a378f9a4ba422f20de9cc80c41b14ffa42701a285f0fd0","source":{"kind":"arxiv","id":"2608.00900","version":1},"attestation_state":"computed","paper":{"title":"An explicit construction of two completely independent spanning trees in the four-dimensional dual-cube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jitendra Prajapati","submitted_at":"2026-08-02T00:00:20Z","abstract_excerpt":"Lalou, Mbarek, Skender and Togni (arXiv:2607.25917) proved that the $n$-dimensional dual-cube $F_n$ admits two completely independent spanning trees for every $n\\ge 5$, observed that none exist for $n\\le 3$, and identified $F_4$ as the first unresolved case, reporting more than 700 hours of inconclusive computation. We settle this case affirmatively by an explicit construction, completing the classification: $F_n$ admits two completely independent spanning trees if and only if $n\\ge 4$. The internal-vertex sets of the two trees are the level sets of a single ten-term cubic polynomial over $\\ma"},"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":"2608.00900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-02T00:00:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d2bbc5efc40121a7c1df9b57fd3a9292be5e2595527315468aae0eda8414b315","abstract_canon_sha256":"7016e54f703b26b21819b2a64c65de5d93f982cbaaea247cce525ec13a857587"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:30.429306Z","signature_b64":"AuT5vceSbC7OMbqA5CEr6mRZgUSPbarsPXAeAt9sk3Ff932kPJbfYLkuXfpPMEaRa1Q/4zEd7QopFS47cWu1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daacc01000e43763a4a378f9a4ba422f20de9cc80c41b14ffa42701a285f0fd0","last_reissued_at":"2026-08-04T01:55:30.427619Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:30.427619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An explicit construction of two completely independent spanning trees in the four-dimensional dual-cube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jitendra Prajapati","submitted_at":"2026-08-02T00:00:20Z","abstract_excerpt":"Lalou, Mbarek, Skender and Togni (arXiv:2607.25917) proved that the $n$-dimensional dual-cube $F_n$ admits two completely independent spanning trees for every $n\\ge 5$, observed that none exist for $n\\le 3$, and identified $F_4$ as the first unresolved case, reporting more than 700 hours of inconclusive computation. We settle this case affirmatively by an explicit construction, completing the classification: $F_n$ admits two completely independent spanning trees if and only if $n\\ge 4$. The internal-vertex sets of the two trees are the level sets of a single ten-term cubic polynomial over $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00900","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/2608.00900/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":"2608.00900","created_at":"2026-08-04T01:55:30.429024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00900v1","created_at":"2026-08-04T01:55:30.429024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00900","created_at":"2026-08-04T01:55:30.429024+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KWMAEAA4Q3W","created_at":"2026-08-04T01:55:30.429024+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KWMAEAA4Q3WHJFD","created_at":"2026-08-04T01:55:30.429024+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KWMAEAA","created_at":"2026-08-04T01:55:30.429024+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/3KWMAEAA4Q3WHJFDPD42JOSCF4","json":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4.json","graph_json":"https://pith.science/api/pith-number/3KWMAEAA4Q3WHJFDPD42JOSCF4/graph.json","events_json":"https://pith.science/api/pith-number/3KWMAEAA4Q3WHJFDPD42JOSCF4/events.json","paper":"https://pith.science/paper/3KWMAEAA"},"agent_actions":{"view_html":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4","download_json":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4.json","view_paper":"https://pith.science/paper/3KWMAEAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00900&json=true","fetch_graph":"https://pith.science/api/pith-number/3KWMAEAA4Q3WHJFDPD42JOSCF4/graph.json","fetch_events":"https://pith.science/api/pith-number/3KWMAEAA4Q3WHJFDPD42JOSCF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4/action/storage_attestation","attest_author":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4/action/author_attestation","sign_citation":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4/action/citation_signature","submit_replication":"https://pith.science/pith/3KWMAEAA4Q3WHJFDPD42JOSCF4/action/replication_record"}},"created_at":"2026-08-04T01:55:30.429024+00:00","updated_at":"2026-08-04T01:55:30.429024+00:00"}