{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HPGYPOJANFXTLOL2TKKUUY5MGQ","short_pith_number":"pith:HPGYPOJA","schema_version":"1.0","canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","source":{"kind":"arxiv","id":"1303.0152","version":1},"attestation_state":"computed","paper":{"title":"Designing Unimodular Codes via Quadratic Optimization is not Always Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Mojtaba Soltanalian, Petre Stoica","submitted_at":"2013-03-01T12:17:45Z","abstract_excerpt":"The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular quadratic programming (UQP)), several computational approaches are devised and studied. A specialized local optimization scheme for UQP is introduced and shown to yield superior results compared to general local optimization methods. Furthermore, a \\textbf{m}onotonically \\textbf{er}ror-bound \\textbf{i}mproving \\textbf{t}echnique (MERIT) is proposed to obtain the gl"},"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":"1303.0152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-01T12:17:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"72de5fceb3c6a16f8861588682cb891df87870b3b4fbaa0fb2962846348de72a","abstract_canon_sha256":"dc9aef406aa2a0486bec4da5e7719c5ea6c9dd5a69f30d9ab8dc60e515f7307e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.006113Z","signature_b64":"imGvf3clgObf9x8ZtuMPB5Tyv+dNK4LIG4vMen6YMU43kI+9WwPBtAm5vHAYPpGoFVwdScEB9cJ5QSnnbrqKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","last_reissued_at":"2026-05-18T02:39:46.005625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.005625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Unimodular Codes via Quadratic Optimization is not Always Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Mojtaba Soltanalian, Petre Stoica","submitted_at":"2013-03-01T12:17:45Z","abstract_excerpt":"The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular quadratic programming (UQP)), several computational approaches are devised and studied. A specialized local optimization scheme for UQP is introduced and shown to yield superior results compared to general local optimization methods. Furthermore, a \\textbf{m}onotonically \\textbf{er}ror-bound \\textbf{i}mproving \\textbf{t}echnique (MERIT) is proposed to obtain the gl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0152","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":""},"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":"1303.0152","created_at":"2026-05-18T02:39:46.005694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0152v1","created_at":"2026-05-18T02:39:46.005694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0152","created_at":"2026-05-18T02:39:46.005694+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPGYPOJANFXT","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPGYPOJANFXTLOL2","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPGYPOJA","created_at":"2026-05-18T12:27:46.883200+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/HPGYPOJANFXTLOL2TKKUUY5MGQ","json":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ.json","graph_json":"https://pith.science/api/pith-number/HPGYPOJANFXTLOL2TKKUUY5MGQ/graph.json","events_json":"https://pith.science/api/pith-number/HPGYPOJANFXTLOL2TKKUUY5MGQ/events.json","paper":"https://pith.science/paper/HPGYPOJA"},"agent_actions":{"view_html":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ","download_json":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ.json","view_paper":"https://pith.science/paper/HPGYPOJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0152&json=true","fetch_graph":"https://pith.science/api/pith-number/HPGYPOJANFXTLOL2TKKUUY5MGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HPGYPOJANFXTLOL2TKKUUY5MGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/action/storage_attestation","attest_author":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/action/author_attestation","sign_citation":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/action/citation_signature","submit_replication":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/action/replication_record"}},"created_at":"2026-05-18T02:39:46.005694+00:00","updated_at":"2026-05-18T02:39:46.005694+00:00"}