{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AJNQJ26TIT2IGKV73ZNNWM3RQ3","short_pith_number":"pith:AJNQJ26T","canonical_record":{"source":{"id":"2509.03980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-09-04T08:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"60fc582f1b9931405d3f9caee1a5bb55acef6cf81ee7e7a569e93a82eec05bb7","abstract_canon_sha256":"367b7c5c64bba0ecf6eeec7a63508dc9c7e969bba3055fd3aebeb10f14dcb438"},"schema_version":"1.0"},"canonical_sha256":"025b04ebd344f4832abfde5adb337186c29e523d42b9e52e7effb9bfb82cfb0b","source":{"kind":"arxiv","id":"2509.03980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03980","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03980v1","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03980","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"AJNQJ26TIT2I","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"AJNQJ26TIT2IGKV7","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"AJNQJ26T","created_at":"2026-07-05T12:04:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AJNQJ26TIT2IGKV73ZNNWM3RQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2509.03980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-09-04T08:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"60fc582f1b9931405d3f9caee1a5bb55acef6cf81ee7e7a569e93a82eec05bb7","abstract_canon_sha256":"367b7c5c64bba0ecf6eeec7a63508dc9c7e969bba3055fd3aebeb10f14dcb438"},"schema_version":"1.0"},"canonical_sha256":"025b04ebd344f4832abfde5adb337186c29e523d42b9e52e7effb9bfb82cfb0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:51.029786Z","signature_b64":"Il9ntprJXhPDtiU7SvKK6wAQbQA3Nyoc2O9RHwphNNryFqM9MkmmQ7L0qxeLJbEAxIHpg1zFAevdV0/FU3kkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025b04ebd344f4832abfde5adb337186c29e523d42b9e52e7effb9bfb82cfb0b","last_reissued_at":"2026-07-05T12:04:51.029291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:51.029291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.03980","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-05T12:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3OboXOIfCdpnoU+5TdytglFktISa+LhkZqlTBJrSiBxSn1HTr69ejvOAfBbqDLot0g1XA4+vvJj3gZR6GcLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:11:58.208969Z"},"content_sha256":"c460207d9c6bb9cf91f52976bd27204b57771e79efff63e78fa1d93aee81123d","schema_version":"1.0","event_id":"sha256:c460207d9c6bb9cf91f52976bd27204b57771e79efff63e78fa1d93aee81123d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AJNQJ26TIT2IGKV73ZNNWM3RQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alessandro Mirri, Enrico Paolini, Jean-Francois Chamberland, Vishnu Teja Kunde","submitted_at":"2025-09-04T08:07:38Z","abstract_excerpt":"This article addresses the problem of multiple preamble detection in random access systems based on orthogonal time frequency space (OTFS) signaling. This challenge is formulated as a structured sparse recovery problem in the complex domain. To tackle it, the authors propose a new approximate message passing (AMP) algorithm that enforces double sparsity: the sparse selection of preambles and the inherent sparsity of OTFS signals in the delay-Doppler domain. From an algorithmic standpoint, the non-separable complex sparsity constraint necessitates a careful derivation and leads to the design of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03980","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/2509.03980/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-05T12:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DRm3q2hR14DqwkYgbEHWHWphDUQiUm4TTM0EjFzhaSE+OJBCOuPC8mcmpnNt8IUrbL6UNd9KTjdB5am8Uq1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:11:58.209956Z"},"content_sha256":"73c3cec6bca0f517d6574cccaa1dc8c8dad37eaaf273b54726ef0ff6c0da672c","schema_version":"1.0","event_id":"sha256:73c3cec6bca0f517d6574cccaa1dc8c8dad37eaaf273b54726ef0ff6c0da672c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/bundle.json","state_url":"https://pith.science/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/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-08T13:11:58Z","links":{"resolver":"https://pith.science/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3","bundle":"https://pith.science/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/bundle.json","state":"https://pith.science/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJNQJ26TIT2IGKV73ZNNWM3RQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AJNQJ26TIT2IGKV73ZNNWM3RQ3","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":"367b7c5c64bba0ecf6eeec7a63508dc9c7e969bba3055fd3aebeb10f14dcb438","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-09-04T08:07:38Z","title_canon_sha256":"60fc582f1b9931405d3f9caee1a5bb55acef6cf81ee7e7a569e93a82eec05bb7"},"schema_version":"1.0","source":{"id":"2509.03980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03980","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03980v1","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03980","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"AJNQJ26TIT2I","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"AJNQJ26TIT2IGKV7","created_at":"2026-07-05T12:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"AJNQJ26T","created_at":"2026-07-05T12:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:73c3cec6bca0f517d6574cccaa1dc8c8dad37eaaf273b54726ef0ff6c0da672c","target":"graph","created_at":"2026-07-05T12:04:51Z","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/2509.03980/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This article addresses the problem of multiple preamble detection in random access systems based on orthogonal time frequency space (OTFS) signaling. This challenge is formulated as a structured sparse recovery problem in the complex domain. To tackle it, the authors propose a new approximate message passing (AMP) algorithm that enforces double sparsity: the sparse selection of preambles and the inherent sparsity of OTFS signals in the delay-Doppler domain. From an algorithmic standpoint, the non-separable complex sparsity constraint necessitates a careful derivation and leads to the design of","authors_text":"Alessandro Mirri, Enrico Paolini, Jean-Francois Chamberland, Vishnu Teja Kunde","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-09-04T08:07:38Z","title":"Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03980","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:c460207d9c6bb9cf91f52976bd27204b57771e79efff63e78fa1d93aee81123d","target":"record","created_at":"2026-07-05T12:04:51Z","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":"367b7c5c64bba0ecf6eeec7a63508dc9c7e969bba3055fd3aebeb10f14dcb438","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-09-04T08:07:38Z","title_canon_sha256":"60fc582f1b9931405d3f9caee1a5bb55acef6cf81ee7e7a569e93a82eec05bb7"},"schema_version":"1.0","source":{"id":"2509.03980","kind":"arxiv","version":1}},"canonical_sha256":"025b04ebd344f4832abfde5adb337186c29e523d42b9e52e7effb9bfb82cfb0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025b04ebd344f4832abfde5adb337186c29e523d42b9e52e7effb9bfb82cfb0b","first_computed_at":"2026-07-05T12:04:51.029291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:51.029291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Il9ntprJXhPDtiU7SvKK6wAQbQA3Nyoc2O9RHwphNNryFqM9MkmmQ7L0qxeLJbEAxIHpg1zFAevdV0/FU3kkBg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:51.029786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.03980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c460207d9c6bb9cf91f52976bd27204b57771e79efff63e78fa1d93aee81123d","sha256:73c3cec6bca0f517d6574cccaa1dc8c8dad37eaaf273b54726ef0ff6c0da672c"],"state_sha256":"941e02a2c1c20a5541018ed3f29c6e6b4fe49ce12876411b4e09f453ce757faa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PLEIyuRipG3Q+SZft/p8V5sw1YdhLgfrMoJcnvArOP6BIgllRvSYQyjYW8z9Ey/HrsnraxYmqGEObmlobFQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:11:58.218222Z","bundle_sha256":"a58854e277bcf8476993b53a4bc2246af1d5057b3b90eb82e39aecc2b06c81fd"}}