{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VQLMCXZHV74U2ADAWLMHCBVWXR","short_pith_number":"pith:VQLMCXZH","schema_version":"1.0","canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","source":{"kind":"arxiv","id":"2605.26180","version":1},"attestation_state":"computed","paper":{"title":"Graph Fractional Fourier Transform: A Unified and Efficient Sampling Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Bing-Zhao Li, Jia-Yin Peng, Yu Zhang","submitted_at":"2026-05-25T07:20:59Z","abstract_excerpt":"The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to minimize error, whereas a wider range of alternative sampling strategies should be admitted. In this paper, a unified and efficient GFRFT sampling theory is proposed. First, a new definition of graph fractional bandlimited signals is introduced, with the corresponding graph fractional sampling and perfect reconstruction theorem, as well as the associated graph "},"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":"2605.26180","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-25T07:20:59Z","cross_cats_sorted":[],"title_canon_sha256":"eb8735913a49420d49afc6c75f57314343c2f088c123b3369f8334043a38d5a7","abstract_canon_sha256":"f2c014ca08f9038f98e466948afba42bef4dfbe428380a9b0f6469cd9510c66e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T00:04:27.675267Z","signature_b64":"5U0r4xxmryhpzFahsBDuMZRDdVr9UCKUac/9nKitDQwydmJchV/ceog2b7azZnUq+WRS7xY0GOb6wUwsr4LZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","last_reissued_at":"2026-05-27T00:04:27.674428Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T00:04:27.674428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Fractional Fourier Transform: A Unified and Efficient Sampling Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Bing-Zhao Li, Jia-Yin Peng, Yu Zhang","submitted_at":"2026-05-25T07:20:59Z","abstract_excerpt":"The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to minimize error, whereas a wider range of alternative sampling strategies should be admitted. In this paper, a unified and efficient GFRFT sampling theory is proposed. First, a new definition of graph fractional bandlimited signals is introduced, with the corresponding graph fractional sampling and perfect reconstruction theorem, as well as the associated graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26180","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26180/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.26180","created_at":"2026-05-27T00:04:27.674571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26180v1","created_at":"2026-05-27T00:04:27.674571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26180","created_at":"2026-05-27T00:04:27.674571+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQLMCXZHV74U","created_at":"2026-05-27T00:04:27.674571+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQLMCXZHV74U2ADA","created_at":"2026-05-27T00:04:27.674571+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQLMCXZH","created_at":"2026-05-27T00:04:27.674571+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/VQLMCXZHV74U2ADAWLMHCBVWXR","json":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR.json","graph_json":"https://pith.science/api/pith-number/VQLMCXZHV74U2ADAWLMHCBVWXR/graph.json","events_json":"https://pith.science/api/pith-number/VQLMCXZHV74U2ADAWLMHCBVWXR/events.json","paper":"https://pith.science/paper/VQLMCXZH"},"agent_actions":{"view_html":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR","download_json":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR.json","view_paper":"https://pith.science/paper/VQLMCXZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26180&json=true","fetch_graph":"https://pith.science/api/pith-number/VQLMCXZHV74U2ADAWLMHCBVWXR/graph.json","fetch_events":"https://pith.science/api/pith-number/VQLMCXZHV74U2ADAWLMHCBVWXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/action/storage_attestation","attest_author":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/action/author_attestation","sign_citation":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/action/citation_signature","submit_replication":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/action/replication_record"}},"created_at":"2026-05-27T00:04:27.674571+00:00","updated_at":"2026-05-27T00:04:27.674571+00:00"}