{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HPGYPOJANFXTLOL2TKKUUY5MGQ","short_pith_number":"pith:HPGYPOJA","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"},"canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","source":{"kind":"arxiv","id":"1303.0152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0152","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0152v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0152","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"HPGYPOJANFXT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HPGYPOJANFXTLOL2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HPGYPOJA","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HPGYPOJANFXTLOL2TKKUUY5MGQ","target":"record","payload":{"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"},"canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","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"},"source_kind":"arxiv","source_id":"1303.0152","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-05-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kaL/O/P8TdNjVMG1uE7RPlKSuUdWKyfTCsM+mVoYLTcZ1+C586dkmZM9RP6TKmmrhC0uTzgLUZHPzmm8I+I8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:34.536178Z"},"content_sha256":"575aee7c1c95844cf22b1c8a06cdfd2e8c5ea6997011ca86ddea6118aacea541","schema_version":"1.0","event_id":"sha256:575aee7c1c95844cf22b1c8a06cdfd2e8c5ea6997011ca86ddea6118aacea541"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HPGYPOJANFXTLOL2TKKUUY5MGQ","target":"graph","payload":{"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"},"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-05-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgWvl2WtvzO1vjtA8v6E7H28l32+lU2FdYhha7nkCJDMs/J0mgZz+V5RVXqvLNIjyACx3sBdizfHsXj+u0JjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:34.536534Z"},"content_sha256":"1ff271a47602c98eab86a7fbecae916252a48a1cf94b1ab343ee58c7a60f35b8","schema_version":"1.0","event_id":"sha256:1ff271a47602c98eab86a7fbecae916252a48a1cf94b1ab343ee58c7a60f35b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/bundle.json","state_url":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/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-06-02T01:42:34Z","links":{"resolver":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ","bundle":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/bundle.json","state":"https://pith.science/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPGYPOJANFXTLOL2TKKUUY5MGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HPGYPOJANFXTLOL2TKKUUY5MGQ","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":"dc9aef406aa2a0486bec4da5e7719c5ea6c9dd5a69f30d9ab8dc60e515f7307e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-01T12:17:45Z","title_canon_sha256":"72de5fceb3c6a16f8861588682cb891df87870b3b4fbaa0fb2962846348de72a"},"schema_version":"1.0","source":{"id":"1303.0152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0152","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0152v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0152","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"HPGYPOJANFXT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HPGYPOJANFXTLOL2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HPGYPOJA","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:1ff271a47602c98eab86a7fbecae916252a48a1cf94b1ab343ee58c7a60f35b8","target":"graph","created_at":"2026-05-18T02:39:46Z","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"},"paper":{"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","authors_text":"Mojtaba Soltanalian, Petre Stoica","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-01T12:17:45Z","title":"Designing Unimodular Codes via Quadratic Optimization is not Always Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0152","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:575aee7c1c95844cf22b1c8a06cdfd2e8c5ea6997011ca86ddea6118aacea541","target":"record","created_at":"2026-05-18T02:39:46Z","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":"dc9aef406aa2a0486bec4da5e7719c5ea6c9dd5a69f30d9ab8dc60e515f7307e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-01T12:17:45Z","title_canon_sha256":"72de5fceb3c6a16f8861588682cb891df87870b3b4fbaa0fb2962846348de72a"},"schema_version":"1.0","source":{"id":"1303.0152","kind":"arxiv","version":1}},"canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bcd87b920696f35b97a9a954a63ac341cf5b92131d4a114c89aeb6de043286c","first_computed_at":"2026-05-18T02:39:46.005625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:46.005625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imGvf3clgObf9x8ZtuMPB5Tyv+dNK4LIG4vMen6YMU43kI+9WwPBtAm5vHAYPpGoFVwdScEB9cJ5QSnnbrqKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:46.006113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:575aee7c1c95844cf22b1c8a06cdfd2e8c5ea6997011ca86ddea6118aacea541","sha256:1ff271a47602c98eab86a7fbecae916252a48a1cf94b1ab343ee58c7a60f35b8"],"state_sha256":"50957a7ec10672c34c9a889823c27c030e194e7fb6b57422eb3d7b63f0d96915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akCAwSGe7GQ5PcgqxUPG2SwuyyLsPXrh6Br1O5dQe7BsQ5GPs79yAV5ljfzSnbVuDNDapx76bIW9vpChvH0VCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:42:34.538380Z","bundle_sha256":"ca3e411406a8defe8ebda994c6f422e8af5f7f9e7578a5075a34d9a1a5681ce8"}}