{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3X35YJCQY3VTO4IMGN63WTVJAY","short_pith_number":"pith:3X35YJCQ","canonical_record":{"source":{"id":"1411.3651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-24T13:58:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc2015ce369217d1cead992b63f0574609a6491d1d7ae9930e4f2326d1c9b7f9","abstract_canon_sha256":"8f5d2bea40814e29bc7e9b300d13246aa0b304b550a891d5fa156f1211684e27"},"schema_version":"1.0"},"canonical_sha256":"ddf7dc2450c6eb37710c337dbb4ea9061334fcfa8e72fca6399dc33be1ed3625","source":{"kind":"arxiv","id":"1411.3651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3651","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3651v2","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3651","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"3X35YJCQY3VT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3X35YJCQY3VTO4IM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3X35YJCQ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3X35YJCQY3VTO4IMGN63WTVJAY","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-24T13:58:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc2015ce369217d1cead992b63f0574609a6491d1d7ae9930e4f2326d1c9b7f9","abstract_canon_sha256":"8f5d2bea40814e29bc7e9b300d13246aa0b304b550a891d5fa156f1211684e27"},"schema_version":"1.0"},"canonical_sha256":"ddf7dc2450c6eb37710c337dbb4ea9061334fcfa8e72fca6399dc33be1ed3625","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.367534Z","signature_b64":"cOOogXtzOjYZFbhlIeUONstyCLoypPInZ09Iz7f7MZkhGxRlmoAE8rB/F1OqXURnQrMiMKEGyS68tJE+DFevDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddf7dc2450c6eb37710c337dbb4ea9061334fcfa8e72fca6399dc33be1ed3625","last_reissued_at":"2026-05-18T00:59:02.367004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.367004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3651","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxrvP2xIAWWrofKdK0qZ+THLnK+1+7vUhGhNP0wBzlO0nz53ou6Z56kOHPgxJlRdGenWKyGdDYlf3tAkeXQ5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:14:47.025089Z"},"content_sha256":"71b3437316c38d91f11f475ee208b23bafb7464d1c7bd1394d5a0b8cd66e5d08","schema_version":"1.0","event_id":"sha256:71b3437316c38d91f11f475ee208b23bafb7464d1c7bd1394d5a0b8cd66e5d08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3X35YJCQY3VTO4IMGN63WTVJAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Fourier Domain as a Domain of Signal Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Irena Orovic, Ljubisa Stankovic, Srdjan Stankovic","submitted_at":"2014-10-24T13:58:33Z","abstract_excerpt":"A compressive sensing (CS) reconstruction method for polynomial phase signals is proposed in this paper. It relies on the Polynomial Fourier transform, which is used to establish a relationship between the observation and sparsity domain. Polynomial phase signals are not sparse in commonly used domains such as Fourier or wavelet domain. Therefore, for polynomial phase signals standard CS algorithms applied in these transformation domains cannot provide satisfactory results. In that sense, the Polynomial Fourier transform is used to ensure sparsity. The proposed approach is generalized using ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3651","kind":"arxiv","version":2},"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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KvJ8HezJjcT1DwRBoQs34gcZWoAl7MQv+e+1hofJ9qHC9GKORgClf8uBynTuyejukdQltRtfeH9ydb7+ZvJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:14:47.025876Z"},"content_sha256":"8937c7c4cdffe3517afe6c67dade83f442a2782082a9234086052a3b1c83c81d","schema_version":"1.0","event_id":"sha256:8937c7c4cdffe3517afe6c67dade83f442a2782082a9234086052a3b1c83c81d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3X35YJCQY3VTO4IMGN63WTVJAY/bundle.json","state_url":"https://pith.science/pith/3X35YJCQY3VTO4IMGN63WTVJAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3X35YJCQY3VTO4IMGN63WTVJAY/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-11T23:14:47Z","links":{"resolver":"https://pith.science/pith/3X35YJCQY3VTO4IMGN63WTVJAY","bundle":"https://pith.science/pith/3X35YJCQY3VTO4IMGN63WTVJAY/bundle.json","state":"https://pith.science/pith/3X35YJCQY3VTO4IMGN63WTVJAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3X35YJCQY3VTO4IMGN63WTVJAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3X35YJCQY3VTO4IMGN63WTVJAY","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":"8f5d2bea40814e29bc7e9b300d13246aa0b304b550a891d5fa156f1211684e27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-24T13:58:33Z","title_canon_sha256":"cc2015ce369217d1cead992b63f0574609a6491d1d7ae9930e4f2326d1c9b7f9"},"schema_version":"1.0","source":{"id":"1411.3651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3651","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3651v2","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3651","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"3X35YJCQY3VT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3X35YJCQY3VTO4IM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3X35YJCQ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:8937c7c4cdffe3517afe6c67dade83f442a2782082a9234086052a3b1c83c81d","target":"graph","created_at":"2026-05-18T00:59:02Z","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 compressive sensing (CS) reconstruction method for polynomial phase signals is proposed in this paper. It relies on the Polynomial Fourier transform, which is used to establish a relationship between the observation and sparsity domain. Polynomial phase signals are not sparse in commonly used domains such as Fourier or wavelet domain. Therefore, for polynomial phase signals standard CS algorithms applied in these transformation domains cannot provide satisfactory results. In that sense, the Polynomial Fourier transform is used to ensure sparsity. The proposed approach is generalized using ti","authors_text":"Irena Orovic, Ljubisa Stankovic, Srdjan Stankovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-24T13:58:33Z","title":"Polynomial Fourier Domain as a Domain of Signal Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3651","kind":"arxiv","version":2},"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:71b3437316c38d91f11f475ee208b23bafb7464d1c7bd1394d5a0b8cd66e5d08","target":"record","created_at":"2026-05-18T00:59:02Z","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":"8f5d2bea40814e29bc7e9b300d13246aa0b304b550a891d5fa156f1211684e27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-24T13:58:33Z","title_canon_sha256":"cc2015ce369217d1cead992b63f0574609a6491d1d7ae9930e4f2326d1c9b7f9"},"schema_version":"1.0","source":{"id":"1411.3651","kind":"arxiv","version":2}},"canonical_sha256":"ddf7dc2450c6eb37710c337dbb4ea9061334fcfa8e72fca6399dc33be1ed3625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddf7dc2450c6eb37710c337dbb4ea9061334fcfa8e72fca6399dc33be1ed3625","first_computed_at":"2026-05-18T00:59:02.367004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.367004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOOogXtzOjYZFbhlIeUONstyCLoypPInZ09Iz7f7MZkhGxRlmoAE8rB/F1OqXURnQrMiMKEGyS68tJE+DFevDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.367534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71b3437316c38d91f11f475ee208b23bafb7464d1c7bd1394d5a0b8cd66e5d08","sha256:8937c7c4cdffe3517afe6c67dade83f442a2782082a9234086052a3b1c83c81d"],"state_sha256":"ffec31e5dc505f9e6a83091a7b133e04322041f307da01deca5925f78e2e9d00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcL32efapjIUNK+PeC7WfY8fEQc5H4ffbPZVMGSWvjkVX9ZjhQH1FoX00bmbVso3Ki3lyfepokK7AbXBZcxLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:14:47.030104Z","bundle_sha256":"12ed70b7d3304dd2f8df25230d18c12c1f432a5eefe13b5203a89cfd9c326147"}}