{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VQLMCXZHV74U2ADAWLMHCBVWXR","short_pith_number":"pith:VQLMCXZH","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"},"canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","source":{"kind":"arxiv","id":"2605.26180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26180","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26180v1","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26180","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"VQLMCXZHV74U","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"VQLMCXZHV74U2ADA","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"VQLMCXZH","created_at":"2026-05-27T00:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VQLMCXZHV74U2ADAWLMHCBVWXR","target":"record","payload":{"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"},"canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","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"},"source_kind":"arxiv","source_id":"2605.26180","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-27T00:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2em6nFM1gRb0FPscqjnrDCBebX0cvmQQrhwt9PQ0Bmb54zmU1S3EXSsVNmT7lfskYHrTj4BliZbG84E+iy7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:25:18.434376Z"},"content_sha256":"5df1741357d9b0b842e956513c9c72870345171936149df17fa40f0478dbbf33","schema_version":"1.0","event_id":"sha256:5df1741357d9b0b842e956513c9c72870345171936149df17fa40f0478dbbf33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VQLMCXZHV74U2ADAWLMHCBVWXR","target":"graph","payload":{"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"},"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-27T00:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYJ0/u8CWr16oKnr/uZJo2o6Z5MOiBE1NPCxjChbygQI7PZsHEQAV8SO0A6tb2HoISNYbu+JvQE4/flXGwmnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:25:18.435160Z"},"content_sha256":"a8bb536b0a51c2d8ce80f8caa866abeefb9e3a137eec174c0641f8a53aba179d","schema_version":"1.0","event_id":"sha256:a8bb536b0a51c2d8ce80f8caa866abeefb9e3a137eec174c0641f8a53aba179d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/bundle.json","state_url":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/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-09T04:25:18Z","links":{"resolver":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR","bundle":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/bundle.json","state":"https://pith.science/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQLMCXZHV74U2ADAWLMHCBVWXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VQLMCXZHV74U2ADAWLMHCBVWXR","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":"f2c014ca08f9038f98e466948afba42bef4dfbe428380a9b0f6469cd9510c66e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-25T07:20:59Z","title_canon_sha256":"eb8735913a49420d49afc6c75f57314343c2f088c123b3369f8334043a38d5a7"},"schema_version":"1.0","source":{"id":"2605.26180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26180","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26180v1","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26180","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"VQLMCXZHV74U","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"VQLMCXZHV74U2ADA","created_at":"2026-05-27T00:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"VQLMCXZH","created_at":"2026-05-27T00:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:a8bb536b0a51c2d8ce80f8caa866abeefb9e3a137eec174c0641f8a53aba179d","target":"graph","created_at":"2026-05-27T00:04:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26180/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Bing-Zhao Li, Jia-Yin Peng, Yu Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-25T07:20:59Z","title":"Graph Fractional Fourier Transform: A Unified and Efficient Sampling Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26180","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:5df1741357d9b0b842e956513c9c72870345171936149df17fa40f0478dbbf33","target":"record","created_at":"2026-05-27T00:04:27Z","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":"f2c014ca08f9038f98e466948afba42bef4dfbe428380a9b0f6469cd9510c66e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-25T07:20:59Z","title_canon_sha256":"eb8735913a49420d49afc6c75f57314343c2f088c123b3369f8334043a38d5a7"},"schema_version":"1.0","source":{"id":"2605.26180","kind":"arxiv","version":1}},"canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac16c15f27aff94d0060b2d87106b6bc41d51d95ba0d786383400fb0ad626716","first_computed_at":"2026-05-27T00:04:27.674428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T00:04:27.674428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5U0r4xxmryhpzFahsBDuMZRDdVr9UCKUac/9nKitDQwydmJchV/ceog2b7azZnUq+WRS7xY0GOb6wUwsr4LZDQ==","signature_status":"signed_v1","signed_at":"2026-05-27T00:04:27.675267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df1741357d9b0b842e956513c9c72870345171936149df17fa40f0478dbbf33","sha256:a8bb536b0a51c2d8ce80f8caa866abeefb9e3a137eec174c0641f8a53aba179d"],"state_sha256":"b6438a6108f668b7217922706ce76ade1108d7834d40537bbd5b4751446ff00f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h77OJU3cjYjRc/a8vJakRELqC2sJAdOSbNOfnB8FnWDUJiwX/BGLVmEy5U8/2YAszvKYWrooz9i9tpzY93f1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:25:18.439510Z","bundle_sha256":"3380e2f037630d619cc862ecd8a2568816b9004efb8d9856b53ebb20d5b93380"}}