{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","short_pith_number":"pith:Y3BGE7UD","canonical_record":{"source":{"id":"2607.25917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T16:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"da2addc560bbe063b36be348992b3fe5aaf5a37db669881f8377e529be88bf65","abstract_canon_sha256":"4faa6e61abc351faedfde62c2c63893c6e65d16a4c9fd7e89b57f7c93f6c1fe4"},"schema_version":"1.0"},"canonical_sha256":"c6c2627e83e417275066527946230e29e6830168315d4ba9251ac6d6b06732e3","source":{"kind":"arxiv","id":"2607.25917","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T16:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"da2addc560bbe063b36be348992b3fe5aaf5a37db669881f8377e529be88bf65","abstract_canon_sha256":"4faa6e61abc351faedfde62c2c63893c6e65d16a4c9fd7e89b57f7c93f6c1fe4"},"schema_version":"1.0"},"canonical_sha256":"c6c2627e83e417275066527946230e29e6830168315d4ba9251ac6d6b06732e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:11.048746Z","signature_b64":"0AyTrun0B3iMKkO9V5t1ukPV3CgqrEahposUU/rHgdZSa1TIBRNO2Q+bGfB1vLgz0EW8gFpmH1GrWXdo06uQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6c2627e83e417275066527946230e29e6830168315d4ba9251ac6d6b06732e3","last_reissued_at":"2026-07-29T01:26:11.047918Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:11.047918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25917","source_version":1,"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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2JZHKaUormxnQ3d8EyC+HvjjFWSWqHHOnjcnb0s5VDP1w3Z8m52Le8KRx1FeAGPPnqAKXE9we0GuETF7uVyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:41:52.543435Z"},"content_sha256":"8b9a1647f554e47e1cd9fea381eaf0a7a95d89956598760df67d98517400255f","schema_version":"1.0","event_id":"sha256:8b9a1647f554e47e1cd9fea381eaf0a7a95d89956598760df67d98517400255f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing two completely independent spanning trees in the dual-cube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdallah Skender, Mohammed Lalou, Nader Mbarek, Olivier Togni","submitted_at":"2026-07-28T16:08:46Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25917","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/2607.25917/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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCLwMVA+pbi7ddSx7pk4KlqjpKB8tpn6yIpMgNLH8G0gp7uUC4LiK/1ExXPeDtK15NCaMmxkDsGVXoQGJ9x4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:41:52.543981Z"},"content_sha256":"d16980d82dcf43c16dd27b8ce4f58b8dcd28f264729cefd089125f035fa6ee64","schema_version":"1.0","event_id":"sha256:d16980d82dcf43c16dd27b8ce4f58b8dcd28f264729cefd089125f035fa6ee64"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1007/s10878-022-00863-0 resolves to 'Constructing tri-CISTs in shuffle-cubes'. A reader following the printed text alone cannot reach it.","snippet":"Y.-H. Chen, K.-J. Pai, H.-J. Lin, and J.-M. Chang. Constructing tri-CISTs in shuffle-cubes. Journal of Combinatorial Optimization, 44(5):3194–3211, Dec. 2022. doi:10.1007/s10878- 022-00863-0","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":"Constructing tri-CISTs in shuffle-cubes","printed_excerpt":"10.1007/s10878-","reconstructed_doi":"10.1007/s10878-022-00863-0"},"severity":"advisory","ref_index":5,"audited_at":"2026-08-03T01:40:30.150285Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10878-022-00863-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2ee3b23aef1cd42cb5730802240189b08afcf1d537f4e84cd12647c100b0d4eb","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Constructing tri-CISTs in shuffle-cubes","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17516,"payload_sha256":"e0435e7a357a958e42ba6f105da11e412361c4a56f312c113e220bf8229b82a8","signature_b64":"DR4DyVZTdjnSysCh9PeaAhyztJoX6sxrcJZRP17/CJ7y8kNdUUNwZ4MCH9omAcylNs5bbhCkdTcW90Bt52iVBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-03T01:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcf6NmFzlysbmct+rFu7Tdf7xXWkqQWPzxZkAbDnltI5lJNaidP7VVDYkqG6rqMNWQ1JLdPmg26WlG8d7KL9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:41:52.553390Z"},"content_sha256":"8d56a7e31b5f3487e5c79a8cbd32d96757b0779f783ca468eebc9feb2166b3a7","schema_version":"1.0","event_id":"sha256:8d56a7e31b5f3487e5c79a8cbd32d96757b0779f783ca468eebc9feb2166b3a7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/0012-365x(76)90039-X resolves to 'On decomposition of r-partite graphs into edge-disjoint hamilton circuits'. A reader following the printed text alone cannot reach it.","snippet":"R. Laskar and B. Auerbach. On decomposition of r-partite graphs into edge-disjoint hamilton circuits.Discrete Mathematics, 14(3):265–268, Jan. 1976. doi:10.1016/0012-365X(76)90039- X","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":"On decomposition of r-partite graphs into edge-disjoint hamilton circuits","printed_excerpt":"10.1016/0012-365x(76)90039-","reconstructed_doi":"10.1016/0012-365x(76)90039-X"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-01T01:22:02.254151Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0012-365x(76)90039-X","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"cdf584351bab0a92e0627ef3b47db0a0d7ba6b039241d59326e82d875806218f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On decomposition of r-partite graphs into edge-disjoint hamilton circuits","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14831,"payload_sha256":"f7638c2d886234742e4aaefc2a1163a208fd051608036d98f98c4cecdabbbc3c","signature_b64":"T02lVLNj2Igm8pyd/Ku7vD2qOtKnf8KHWebjfQWx/0fH0ToyksmFfVqNTLAyCwq9fZu9iVo4mJs+f4rep9yFBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:26:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twOxby9tARQ9VTHcm/ppQoeIAg3CPttFImcYF8pgekZ8TqDIkrGusW6oKjubLENTK+rpjmcycYvHZnx/XubICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:41:52.554035Z"},"content_sha256":"46f46736bd4b97179f4cfda27492e4110da72446e84e2b283a2d459933d15145","schema_version":"1.0","event_id":"sha256:46f46736bd4b97179f4cfda27492e4110da72446e84e2b283a2d459933d15145"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:Y3BGE7UD4QLSOUDGKJ4UMIYOFH","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10878-022-00863-0) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Y.-H. Chen, K.-J. Pai, H.-J. Lin, and J.-M. Chang. Constructing tri-CISTs in shuffle-cubes. Journal of Combinatorial Optimization, 44(5):3194–3211, Dec. 2022. doi:10.1007/s10878- 022-00863-0","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10878-","reconstructed_doi":"10.1007/s10878-022-00863-0"},"severity":"advisory","ref_index":5,"audited_at":"2026-08-01T01:22:02.254151Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10878-022-00863-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a5c80e0bc9da9066397c33a23ad55af4280722bfffda128e20712d0a16372866","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14830,"payload_sha256":"200c86b4987001fedd863995162645145068d4afc07e53df73f8f01209668e27","signature_b64":"5kA6V1vy49AwQ+41nkfMLIfEs/hbbwIZJDUosmhwehVX75TYaEAKdcQWZwp8JAfPDKtwSyuPhSTDCcdu9wmrAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:26:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhwTDNXVaLT8s+XeAdgcoVW5SkQEfXGFijwe7QNkPyMFbA3Cbca9XGHVC7XMFcXIv+jyRXPFso6w+cuSwcEqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:41:52.554805Z"},"content_sha256":"9a3ccd9d3a107e2564dd522596f4ff638c29b40a4326ac3c01aaf297ffb1aad1","schema_version":"1.0","event_id":"sha256:9a3ccd9d3a107e2564dd522596f4ff638c29b40a4326ac3c01aaf297ffb1aad1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/bundle.json","state_url":"https://pith.science/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/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-11T13:41:52Z","links":{"resolver":"https://pith.science/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH","bundle":"https://pith.science/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/bundle.json","state":"https://pith.science/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3BGE7UD4QLSOUDGKJ4UMIYOFH/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Urk8jr9o+D+/4FiwMesElMkm4ryOfsqqyNpRCHIlLE0D/OuoBJOtSUzhqIxWywrcme8BD4n/emONiSpFSbtTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:41:52.558473Z","bundle_sha256":"9e2ab36f4a190e96294f9c74d7d8abff6aaade65e9ddfc4ff868a800e7dfa5fe"}}