{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BGWKU4BACOE63S7IOZ6NX27ZI2","short_pith_number":"pith:BGWKU4BA","canonical_record":{"source":{"id":"2605.06198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-07T13:08:43Z","cross_cats_sorted":[],"title_canon_sha256":"14880c1e4c86ad71515bbc86db37055eec756bf5fd531a11ce6e224f8dd06169","abstract_canon_sha256":"b2ca7ed8f53b4653e124150c18190328a7f4d201c420c485963bb22eb0dbd94b"},"schema_version":"1.0"},"canonical_sha256":"09acaa70201389edcbe8767cdbebf946b3c6d50f31b7205e995a52935b14b6e9","source":{"kind":"arxiv","id":"2605.06198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06198","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06198v2","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06198","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"BGWKU4BACOE6","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"BGWKU4BACOE63S7I","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"BGWKU4BA","created_at":"2026-05-28T01:05:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BGWKU4BACOE63S7IOZ6NX27ZI2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.06198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-07T13:08:43Z","cross_cats_sorted":[],"title_canon_sha256":"14880c1e4c86ad71515bbc86db37055eec756bf5fd531a11ce6e224f8dd06169","abstract_canon_sha256":"b2ca7ed8f53b4653e124150c18190328a7f4d201c420c485963bb22eb0dbd94b"},"schema_version":"1.0"},"canonical_sha256":"09acaa70201389edcbe8767cdbebf946b3c6d50f31b7205e995a52935b14b6e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:12.502895Z","signature_b64":"RuV4BXJPkMv/58+Lr5QNkYw9R6bJQDuBWhXYkQzAFgnvBeV5642LfUGTqFkPbXldlPWvDMsdhowwVJ9mmBEjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09acaa70201389edcbe8767cdbebf946b3c6d50f31b7205e995a52935b14b6e9","last_reissued_at":"2026-05-28T01:05:12.502400Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:12.502400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.06198","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-05-28T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GeoDxgpUzQl5FI9ST4UimlcNCsv20FJ621uovKWkcp4tp1r1uoKv0W81oTZXf+QiTtgW8TkgVwS3FOfHb98Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:59:35.826142Z"},"content_sha256":"7b198a7542c0e9428fea87531ff26d7b0d48ae89a2c921325b0fdf2d9fab2fc5","schema_version":"1.0","event_id":"sha256:7b198a7542c0e9428fea87531ff26d7b0d48ae89a2c921325b0fdf2d9fab2fc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BGWKU4BACOE63S7IOZ6NX27ZI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal Least Squares with Integrated Information Theoretic Criteria for Joint Number of Targets and DoA Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fran\\c{c}ois Horlin, Gilles Monnoyer, J\\'er\\^ome Louveaux, Martin Willame","submitted_at":"2026-05-07T13:08:43Z","abstract_excerpt":"We address the joint estimation of the number of targets and their direction-of-arrivals (DoAs) using antenna arrays. Target-number estimation can be formulated as a model-order selection problem and solved with the information theoretic criteria (ITC). The ITC minimize an objective function that balances a likelihood term and a complexity penalty. However, direct application of the ITC requires maximum-likelihood DoA estimates for each candidate model order, which is computationally prohibitive because it entails a multidimensional search over all angle combinations. To reduce complexity, man"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Numerical simulations show that the proposed hybrid ITC-OLS algorithm consistently outperforms both the other proposed variants and a baseline method from the literature.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That embedding the ITC penalty inside the OLS greedy steps preserves the statistical consistency of model-order selection without introducing bias from the sequential nature of the search.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Hybrid ITC-OLS algorithm integrates model-order selection into greedy DoA estimation and outperforms other variants and a literature baseline in simulations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ae7ae4483c044733c1645bc49de39ec0d2da66cada4ec40b6359e0c0d499826a"},"source":{"id":"2605.06198","kind":"arxiv","version":2},"verdict":{"id":"e8c3f7e9-331b-4b9a-984a-8b93bf2ec5d8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T06:51:18.642335Z","strongest_claim":"Numerical simulations show that the proposed hybrid ITC-OLS algorithm consistently outperforms both the other proposed variants and a baseline method from the literature.","one_line_summary":"Hybrid ITC-OLS algorithm integrates model-order selection into greedy DoA estimation and outperforms other variants and a literature baseline in simulations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That embedding the ITC penalty inside the OLS greedy steps preserves the statistical consistency of model-order selection without introducing bias from the sequential nature of the search.","pith_extraction_headline":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.06198/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T13:02:04.241044Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T08:35:26.880392Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.197452Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T12:54:05.623597Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f0af0834471593bb8c382224d805480ca4cc19ab287f363b7b65ccd41956fd73"},"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":"e8c3f7e9-331b-4b9a-984a-8b93bf2ec5d8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTkPwMTjijIPC6rfV4TmeqpczRcE2GgT5IrW+eRBwGp4m1GZjDnZWs37PQBClD8RZWIsPI4826Ca4x1nnSdYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:59:35.827235Z"},"content_sha256":"aadf9728915dd54e2c88e80d994282a53b1f987782e31d41637ffa28fdef30f1","schema_version":"1.0","event_id":"sha256:aadf9728915dd54e2c88e80d994282a53b1f987782e31d41637ffa28fdef30f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/bundle.json","state_url":"https://pith.science/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/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-05-31T00:59:35Z","links":{"resolver":"https://pith.science/pith/BGWKU4BACOE63S7IOZ6NX27ZI2","bundle":"https://pith.science/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/bundle.json","state":"https://pith.science/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGWKU4BACOE63S7IOZ6NX27ZI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BGWKU4BACOE63S7IOZ6NX27ZI2","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":"b2ca7ed8f53b4653e124150c18190328a7f4d201c420c485963bb22eb0dbd94b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-07T13:08:43Z","title_canon_sha256":"14880c1e4c86ad71515bbc86db37055eec756bf5fd531a11ce6e224f8dd06169"},"schema_version":"1.0","source":{"id":"2605.06198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06198","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06198v2","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06198","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"BGWKU4BACOE6","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"BGWKU4BACOE63S7I","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"BGWKU4BA","created_at":"2026-05-28T01:05:12Z"}],"graph_snapshots":[{"event_id":"sha256:aadf9728915dd54e2c88e80d994282a53b1f987782e31d41637ffa28fdef30f1","target":"graph","created_at":"2026-05-28T01:05:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Numerical simulations show that the proposed hybrid ITC-OLS algorithm consistently outperforms both the other proposed variants and a baseline method from the literature."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That embedding the ITC penalty inside the OLS greedy steps preserves the statistical consistency of model-order selection without introducing bias from the sequential nature of the search."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Hybrid ITC-OLS algorithm integrates model-order selection into greedy DoA estimation and outperforms other variants and a literature baseline in simulations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival."}],"snapshot_sha256":"ae7ae4483c044733c1645bc49de39ec0d2da66cada4ec40b6359e0c0d499826a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T13:02:04.241044Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T08:35:26.880392Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.197452Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:54:05.623597Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06198/integrity.json","findings":[],"snapshot_sha256":"f0af0834471593bb8c382224d805480ca4cc19ab287f363b7b65ccd41956fd73","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the joint estimation of the number of targets and their direction-of-arrivals (DoAs) using antenna arrays. Target-number estimation can be formulated as a model-order selection problem and solved with the information theoretic criteria (ITC). The ITC minimize an objective function that balances a likelihood term and a complexity penalty. However, direct application of the ITC requires maximum-likelihood DoA estimates for each candidate model order, which is computationally prohibitive because it entails a multidimensional search over all angle combinations. To reduce complexity, man","authors_text":"Fran\\c{c}ois Horlin, Gilles Monnoyer, J\\'er\\^ome Louveaux, Martin Willame","cross_cats":[],"headline":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-07T13:08:43Z","title":"Orthogonal Least Squares with Integrated Information Theoretic Criteria for Joint Number of Targets and DoA Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.06198","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T06:51:18.642335Z","id":"e8c3f7e9-331b-4b9a-984a-8b93bf2ec5d8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Hybrid ITC-OLS algorithm integrates model-order selection into greedy DoA estimation and outperforms other variants and a literature baseline in simulations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Integrating information theoretic criteria into orthogonal least squares enables joint estimation of the number of targets and their directions of arrival.","strongest_claim":"Numerical simulations show that the proposed hybrid ITC-OLS algorithm consistently outperforms both the other proposed variants and a baseline method from the literature.","weakest_assumption":"That embedding the ITC penalty inside the OLS greedy steps preserves the statistical consistency of model-order selection without introducing bias from the sequential nature of the search."}},"verdict_id":"e8c3f7e9-331b-4b9a-984a-8b93bf2ec5d8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b198a7542c0e9428fea87531ff26d7b0d48ae89a2c921325b0fdf2d9fab2fc5","target":"record","created_at":"2026-05-28T01:05:12Z","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":"b2ca7ed8f53b4653e124150c18190328a7f4d201c420c485963bb22eb0dbd94b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-07T13:08:43Z","title_canon_sha256":"14880c1e4c86ad71515bbc86db37055eec756bf5fd531a11ce6e224f8dd06169"},"schema_version":"1.0","source":{"id":"2605.06198","kind":"arxiv","version":2}},"canonical_sha256":"09acaa70201389edcbe8767cdbebf946b3c6d50f31b7205e995a52935b14b6e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09acaa70201389edcbe8767cdbebf946b3c6d50f31b7205e995a52935b14b6e9","first_computed_at":"2026-05-28T01:05:12.502400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:12.502400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RuV4BXJPkMv/58+Lr5QNkYw9R6bJQDuBWhXYkQzAFgnvBeV5642LfUGTqFkPbXldlPWvDMsdhowwVJ9mmBEjCg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:12.502895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b198a7542c0e9428fea87531ff26d7b0d48ae89a2c921325b0fdf2d9fab2fc5","sha256:aadf9728915dd54e2c88e80d994282a53b1f987782e31d41637ffa28fdef30f1"],"state_sha256":"e66ec6132efa8bea25dcd8807de86e1b6d828c3a82b0381260a43bb655fbc8dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDjPXPnFMiX4x+vVeEEtvXBBEapf8fz53wOPUZ9aSpGQWpK8YhHxNDSsSOmlBy1KB8iIxsTiPXZesNwPkBNNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:59:35.832175Z","bundle_sha256":"b93b1294e3072f6c9bed6e8549eb18c0deb2437c2ec99273cda6cb081a191df1"}}