{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OR5E5A7LPPGKVW2K7N6UBGMIXA","short_pith_number":"pith:OR5E5A7L","schema_version":"1.0","canonical_sha256":"747a4e83eb7bccaadb4afb7d409988b808396bc4473088d815738eb76d2f3398","source":{"kind":"arxiv","id":"1711.00386","version":2},"attestation_state":"computed","paper":{"title":"Analyzing the Approximation Error of the Fast Graph Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Luc LeMagoarou, Nicolas Tremblay, R\\'emi Gribonval","submitted_at":"2017-11-01T15:09:10Z","abstract_excerpt":"The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J, represents a trade-off between precision of the transform and time of computation (and storage space). We explore further this trade-off and study, on different types of graphs, how is the approximation err"},"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":"1711.00386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T15:09:10Z","cross_cats_sorted":[],"title_canon_sha256":"50e12a761a89b9b588e4a8fde3bac9d5d8ce736b74563895761b7758c8d703af","abstract_canon_sha256":"419b36d7d5e168a0179377ca41570e64ccf0dc4d569f6d98c48bf5a3d51464d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.370775Z","signature_b64":"Z/jp+UC3gYL8UnFb8yxFxpz7aOR2mQAoP3DTK26OYESLTBLrK0pwBP8q2lTmds6g0O7jJxVBx7UOspWZwlfnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"747a4e83eb7bccaadb4afb7d409988b808396bc4473088d815738eb76d2f3398","last_reissued_at":"2026-05-18T00:31:18.369795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.369795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing the Approximation Error of the Fast Graph Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Luc LeMagoarou, Nicolas Tremblay, R\\'emi Gribonval","submitted_at":"2017-11-01T15:09:10Z","abstract_excerpt":"The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J, represents a trade-off between precision of the transform and time of computation (and storage space). We explore further this trade-off and study, on different types of graphs, how is the approximation err"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00386","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.00386","created_at":"2026-05-18T00:31:18.369886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00386v2","created_at":"2026-05-18T00:31:18.369886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00386","created_at":"2026-05-18T00:31:18.369886+00:00"},{"alias_kind":"pith_short_12","alias_value":"OR5E5A7LPPGK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OR5E5A7LPPGKVW2K","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OR5E5A7L","created_at":"2026-05-18T12:31:34.259226+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/OR5E5A7LPPGKVW2K7N6UBGMIXA","json":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA.json","graph_json":"https://pith.science/api/pith-number/OR5E5A7LPPGKVW2K7N6UBGMIXA/graph.json","events_json":"https://pith.science/api/pith-number/OR5E5A7LPPGKVW2K7N6UBGMIXA/events.json","paper":"https://pith.science/paper/OR5E5A7L"},"agent_actions":{"view_html":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA","download_json":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA.json","view_paper":"https://pith.science/paper/OR5E5A7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00386&json=true","fetch_graph":"https://pith.science/api/pith-number/OR5E5A7LPPGKVW2K7N6UBGMIXA/graph.json","fetch_events":"https://pith.science/api/pith-number/OR5E5A7LPPGKVW2K7N6UBGMIXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA/action/storage_attestation","attest_author":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA/action/author_attestation","sign_citation":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA/action/citation_signature","submit_replication":"https://pith.science/pith/OR5E5A7LPPGKVW2K7N6UBGMIXA/action/replication_record"}},"created_at":"2026-05-18T00:31:18.369886+00:00","updated_at":"2026-05-18T00:31:18.369886+00:00"}