{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VUPP5HG7MTWQIPEDQ45EJU2S3K","short_pith_number":"pith:VUPP5HG7","canonical_record":{"source":{"id":"1302.2082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-08T16:49:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7cba4519d679727eef2e6c41e647172bb7170a3ac17f96ec4aeeaf15d66e9560","abstract_canon_sha256":"a5079a9117cf9cc41e50ef9c18a1906ab68431f170286df7e7513f3eda6dd2a7"},"schema_version":"1.0"},"canonical_sha256":"ad1efe9cdf64ed043c83873a44d352dabac485cfed80cd0c9b326400f0a2ed7d","source":{"kind":"arxiv","id":"1302.2082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2082","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2082v3","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2082","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"VUPP5HG7MTWQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUPP5HG7MTWQIPED","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUPP5HG7","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VUPP5HG7MTWQIPEDQ45EJU2S3K","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-08T16:49:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7cba4519d679727eef2e6c41e647172bb7170a3ac17f96ec4aeeaf15d66e9560","abstract_canon_sha256":"a5079a9117cf9cc41e50ef9c18a1906ab68431f170286df7e7513f3eda6dd2a7"},"schema_version":"1.0"},"canonical_sha256":"ad1efe9cdf64ed043c83873a44d352dabac485cfed80cd0c9b326400f0a2ed7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:05.740993Z","signature_b64":"0eMWLYp9irJoOAqAffoOSUUwvmC6iWD+/PWcNIUoTpg/hUxcMdD/nFOKGKOJgN6InGEKFbA0flAmI3UmMtESDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad1efe9cdf64ed043c83873a44d352dabac485cfed80cd0c9b326400f0a2ed7d","last_reissued_at":"2026-05-18T03:02:05.740340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:05.740340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2082","source_version":3,"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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6ZB+QFanUVi45eov0g0/SfWxpKJo+ef1UiVBRTb2nt20lhk+EOQ00gwuNI6x7TfNY6/sTBYecp82hXkar4ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:24:06.256766Z"},"content_sha256":"19508937052a2abc261cf70ea9becf89afd77fec4c64c95ebdc2a8c312d24620","schema_version":"1.0","event_id":"sha256:19508937052a2abc261cf70ea9becf89afd77fec4c64c95ebdc2a8c312d24620"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VUPP5HG7MTWQIPEDQ45EJU2S3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequences with Minimal Time-Frequency Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Vetterli, Reza Parhizkar, Yann Barbotin","submitted_at":"2013-02-08T16:49:22Z","abstract_excerpt":"A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining an \"uncertainty\" lower bound. Taking the variance as a measure of localization in time and frequency, Gaussian functions reach this bound for continuous-time signals. For sequences, however, this is not true; it is known that Heisenberg's bound is generally unachievable. For a chosen frequency variance, we formulate the search for \"maximally c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2082","kind":"arxiv","version":3},"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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BiCGv6qtX0LQC5p0nYmr32UxcgNXimeOwgRHbANEBclooh9rmQ1yUtV7aYZ768SOfzu9XdNKEML+QHvlbNNmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:24:06.257454Z"},"content_sha256":"17660f0a8c9bb98b473e39190ecf249eb5aa9c87b7eabddd49da915bc750fb0d","schema_version":"1.0","event_id":"sha256:17660f0a8c9bb98b473e39190ecf249eb5aa9c87b7eabddd49da915bc750fb0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/bundle.json","state_url":"https://pith.science/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/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-29T19:24:06Z","links":{"resolver":"https://pith.science/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K","bundle":"https://pith.science/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/bundle.json","state":"https://pith.science/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUPP5HG7MTWQIPEDQ45EJU2S3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VUPP5HG7MTWQIPEDQ45EJU2S3K","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":"a5079a9117cf9cc41e50ef9c18a1906ab68431f170286df7e7513f3eda6dd2a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-08T16:49:22Z","title_canon_sha256":"7cba4519d679727eef2e6c41e647172bb7170a3ac17f96ec4aeeaf15d66e9560"},"schema_version":"1.0","source":{"id":"1302.2082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2082","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2082v3","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2082","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"VUPP5HG7MTWQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUPP5HG7MTWQIPED","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUPP5HG7","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:17660f0a8c9bb98b473e39190ecf249eb5aa9c87b7eabddd49da915bc750fb0d","target":"graph","created_at":"2026-05-18T03:02:05Z","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":"A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining an \"uncertainty\" lower bound. Taking the variance as a measure of localization in time and frequency, Gaussian functions reach this bound for continuous-time signals. For sequences, however, this is not true; it is known that Heisenberg's bound is generally unachievable. For a chosen frequency variance, we formulate the search for \"maximally c","authors_text":"Martin Vetterli, Reza Parhizkar, Yann Barbotin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-08T16:49:22Z","title":"Sequences with Minimal Time-Frequency Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2082","kind":"arxiv","version":3},"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:19508937052a2abc261cf70ea9becf89afd77fec4c64c95ebdc2a8c312d24620","target":"record","created_at":"2026-05-18T03:02:05Z","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":"a5079a9117cf9cc41e50ef9c18a1906ab68431f170286df7e7513f3eda6dd2a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-08T16:49:22Z","title_canon_sha256":"7cba4519d679727eef2e6c41e647172bb7170a3ac17f96ec4aeeaf15d66e9560"},"schema_version":"1.0","source":{"id":"1302.2082","kind":"arxiv","version":3}},"canonical_sha256":"ad1efe9cdf64ed043c83873a44d352dabac485cfed80cd0c9b326400f0a2ed7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad1efe9cdf64ed043c83873a44d352dabac485cfed80cd0c9b326400f0a2ed7d","first_computed_at":"2026-05-18T03:02:05.740340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:05.740340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0eMWLYp9irJoOAqAffoOSUUwvmC6iWD+/PWcNIUoTpg/hUxcMdD/nFOKGKOJgN6InGEKFbA0flAmI3UmMtESDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:05.740993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19508937052a2abc261cf70ea9becf89afd77fec4c64c95ebdc2a8c312d24620","sha256:17660f0a8c9bb98b473e39190ecf249eb5aa9c87b7eabddd49da915bc750fb0d"],"state_sha256":"a5362ef0a5240f78019dec1202160b5d94b32576df018f7753a6a25867dca3ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwFQ119h9joy1sdRta916K7WFsIwg8fIzsCvmWmyioUhGyhAEUfUldDsF4l9fJPcuYsoUTMY7+L2P6JvDbW7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:24:06.261204Z","bundle_sha256":"8b4d1301ccc1fd8eacff90f2e6dd33602dd11b1f7efb329c44b9aed13d2ff1ab"}}