{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FN4ON4ACBEGQAJB4OB2VG7CK3Y","short_pith_number":"pith:FN4ON4AC","canonical_record":{"source":{"id":"2605.04765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-06T11:12:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a8c92f0c79f2f60b3999c0ba09f16e5a2c2c410325c610cff52f03df5af8dcfe","abstract_canon_sha256":"fee9ef7aaad0254ca9e14ce59d741cccff1224516b06a069185203fec748d31c"},"schema_version":"1.0"},"canonical_sha256":"2b78e6f002090d00243c7075537c4ade13deae0492263513768974a4f2e6e542","source":{"kind":"arxiv","id":"2605.04765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04765","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04765v2","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04765","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"FN4ON4ACBEGQ","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_16","alias_value":"FN4ON4ACBEGQAJB4","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_8","alias_value":"FN4ON4AC","created_at":"2026-06-10T01:10:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FN4ON4ACBEGQAJB4OB2VG7CK3Y","target":"record","payload":{"canonical_record":{"source":{"id":"2605.04765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-06T11:12:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a8c92f0c79f2f60b3999c0ba09f16e5a2c2c410325c610cff52f03df5af8dcfe","abstract_canon_sha256":"fee9ef7aaad0254ca9e14ce59d741cccff1224516b06a069185203fec748d31c"},"schema_version":"1.0"},"canonical_sha256":"2b78e6f002090d00243c7075537c4ade13deae0492263513768974a4f2e6e542","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:02.754682Z","signature_b64":"O2rU7JWEJo9AM8oWunROOtDjgCtafW6Kgd2MYwBR3FyH90R6+s6kwyrO/okuQQk+/K0m7fpHKqpFdyGCpbT2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b78e6f002090d00243c7075537c4ade13deae0492263513768974a4f2e6e542","last_reissued_at":"2026-06-10T01:10:02.753849Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:02.753849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.04765","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-06-10T01:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkUrGK9MWh76Yh4y66QkZPDYtabzRgrBgeEZasBYXm90YUy4tVFh/jbXiswgb/87Tqr0iw3vaHfITrhg2gmyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:26:30.895392Z"},"content_sha256":"a2056cdb5de3a3bde10f35831314ddc9498977c1d9c4e06711368b2b24df7c86","schema_version":"1.0","event_id":"sha256:a2056cdb5de3a3bde10f35831314ddc9498977c1d9c4e06711368b2b24df7c86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FN4ON4ACBEGQAJB4OB2VG7CK3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized FC-Gram Approximation Framework with Analysis and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Akash Anand, Prakash Nainwal","submitted_at":"2026-05-06T11:12:36Z","abstract_excerpt":"The FC-Gram algorithm constructs high-order trigonometric approximations of nonperiodic functions by periodically extending them to a larger interval, with the quality of the blending continuation of Gram polynomials over the extension interval directly governing the approximation accuracy. We introduce GenFC, a generalized FC-Gram framework in which the continuation of each Gram polynomial is shaped by a cutoff function satisfying prescribed boundary flatness conditions. We establish a convergence theorem showing that for any such family the GenFC approximation error satisfies $O(n^{-\\min(r+\\"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish a convergence theorem showing that the trigonometric interpolant converges at the rate O(n^{-min(r+β,d)}) in the supremum norm on the original interval, where r is the smoothness of the target function, d the number of Gram polynomials, and β ∈ [0,1] a Fourier-decay parameter.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The blending continuation of Gram polynomials can be constructed with the stated flexibility while preserving the controlled boundary behavior and without introducing uncontrolled errors that would invalidate the convergence analysis.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GenFC generalizes FC-Gram via flexible Gram polynomial blending, proving O(n^{-min(r+β,d)}) convergence and showing better accuracy than prior versions in numerical tests.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f5547f1f13e0d6e67e2e93bf98d64e7c49837080ae0f06ebd4eed91c48c19dee"},"source":{"id":"2605.04765","kind":"arxiv","version":2},"verdict":{"id":"aaefa962-93b4-461d-80b4-4360bcb74ff8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T15:47:49.606749Z","strongest_claim":"We establish a convergence theorem showing that the trigonometric interpolant converges at the rate O(n^{-min(r+β,d)}) in the supremum norm on the original interval, where r is the smoothness of the target function, d the number of Gram polynomials, and β ∈ [0,1] a Fourier-decay parameter.","one_line_summary":"GenFC generalizes FC-Gram via flexible Gram polynomial blending, proving O(n^{-min(r+β,d)}) convergence and showing better accuracy than prior versions in numerical tests.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The blending continuation of Gram polynomials can be constructed with the stated flexibility while preserving the controlled boundary behavior and without introducing uncontrolled errors that would invalidate the convergence analysis.","pith_extraction_headline":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04765/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T11:34:43.324498Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:29.176049Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:11:40.207049Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"759834e52e7d2c7b5d2bbbf49217070d3f0b4c35bd3b2bf71e34137d868572a9"},"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":"aaefa962-93b4-461d-80b4-4360bcb74ff8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvIDbazMrXmFh2KMzXU064NSxJRATZsdBc3n8uaLEcjLdV+0Dm+cx1oXiVoHWKdqs10nonC4yCy7UaE1YoURBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:26:30.896674Z"},"content_sha256":"ab504808d9bb39237f35f0f5ab128d4e0a8ed6ebd3377441ec29dda0de2c0665","schema_version":"1.0","event_id":"sha256:ab504808d9bb39237f35f0f5ab128d4e0a8ed6ebd3377441ec29dda0de2c0665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/bundle.json","state_url":"https://pith.science/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/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-10T22:26:30Z","links":{"resolver":"https://pith.science/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y","bundle":"https://pith.science/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/bundle.json","state":"https://pith.science/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FN4ON4ACBEGQAJB4OB2VG7CK3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FN4ON4ACBEGQAJB4OB2VG7CK3Y","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":"fee9ef7aaad0254ca9e14ce59d741cccff1224516b06a069185203fec748d31c","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-06T11:12:36Z","title_canon_sha256":"a8c92f0c79f2f60b3999c0ba09f16e5a2c2c410325c610cff52f03df5af8dcfe"},"schema_version":"1.0","source":{"id":"2605.04765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04765","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04765v2","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04765","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"FN4ON4ACBEGQ","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_16","alias_value":"FN4ON4ACBEGQAJB4","created_at":"2026-06-10T01:10:02Z"},{"alias_kind":"pith_short_8","alias_value":"FN4ON4AC","created_at":"2026-06-10T01:10:02Z"}],"graph_snapshots":[{"event_id":"sha256:ab504808d9bb39237f35f0f5ab128d4e0a8ed6ebd3377441ec29dda0de2c0665","target":"graph","created_at":"2026-06-10T01:10: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We establish a convergence theorem showing that the trigonometric interpolant converges at the rate O(n^{-min(r+β,d)}) in the supremum norm on the original interval, where r is the smoothness of the target function, d the number of Gram polynomials, and β ∈ [0,1] a Fourier-decay parameter."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The blending continuation of Gram polynomials can be constructed with the stated flexibility while preserving the controlled boundary behavior and without introducing uncontrolled errors that would invalidate the convergence analysis."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GenFC generalizes FC-Gram via flexible Gram polynomial blending, proving O(n^{-min(r+β,d)}) convergence and showing better accuracy than prior versions in numerical tests."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions."}],"snapshot_sha256":"f5547f1f13e0d6e67e2e93bf98d64e7c49837080ae0f06ebd4eed91c48c19dee"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T11:34:43.324498Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:29.176049Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:11:40.207049Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.04765/integrity.json","findings":[],"snapshot_sha256":"759834e52e7d2c7b5d2bbbf49217070d3f0b4c35bd3b2bf71e34137d868572a9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The FC-Gram algorithm constructs high-order trigonometric approximations of nonperiodic functions by periodically extending them to a larger interval, with the quality of the blending continuation of Gram polynomials over the extension interval directly governing the approximation accuracy. We introduce GenFC, a generalized FC-Gram framework in which the continuation of each Gram polynomial is shaped by a cutoff function satisfying prescribed boundary flatness conditions. We establish a convergence theorem showing that for any such family the GenFC approximation error satisfies $O(n^{-\\min(r+\\","authors_text":"Akash Anand, Prakash Nainwal","cross_cats":["cs.NA"],"headline":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-06T11:12:36Z","title":"A Generalized FC-Gram Approximation Framework with Analysis and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04765","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T15:47:49.606749Z","id":"aaefa962-93b4-461d-80b4-4360bcb74ff8","model_set":{"reader":"grok-4.3"},"one_line_summary":"GenFC generalizes FC-Gram via flexible Gram polynomial blending, proving O(n^{-min(r+β,d)}) convergence and showing better accuracy than prior versions in numerical tests.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A generalized FC-Gram framework adds flexibility to Gram polynomial blending and proves convergence rates of O(n to the minus min of r plus beta and d) for non-periodic functions.","strongest_claim":"We establish a convergence theorem showing that the trigonometric interpolant converges at the rate O(n^{-min(r+β,d)}) in the supremum norm on the original interval, where r is the smoothness of the target function, d the number of Gram polynomials, and β ∈ [0,1] a Fourier-decay parameter.","weakest_assumption":"The blending continuation of Gram polynomials can be constructed with the stated flexibility while preserving the controlled boundary behavior and without introducing uncontrolled errors that would invalidate the convergence analysis."}},"verdict_id":"aaefa962-93b4-461d-80b4-4360bcb74ff8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a2056cdb5de3a3bde10f35831314ddc9498977c1d9c4e06711368b2b24df7c86","target":"record","created_at":"2026-06-10T01:10: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":"fee9ef7aaad0254ca9e14ce59d741cccff1224516b06a069185203fec748d31c","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-06T11:12:36Z","title_canon_sha256":"a8c92f0c79f2f60b3999c0ba09f16e5a2c2c410325c610cff52f03df5af8dcfe"},"schema_version":"1.0","source":{"id":"2605.04765","kind":"arxiv","version":2}},"canonical_sha256":"2b78e6f002090d00243c7075537c4ade13deae0492263513768974a4f2e6e542","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b78e6f002090d00243c7075537c4ade13deae0492263513768974a4f2e6e542","first_computed_at":"2026-06-10T01:10:02.753849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:02.753849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O2rU7JWEJo9AM8oWunROOtDjgCtafW6Kgd2MYwBR3FyH90R6+s6kwyrO/okuQQk+/K0m7fpHKqpFdyGCpbT2Aw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:02.754682Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2056cdb5de3a3bde10f35831314ddc9498977c1d9c4e06711368b2b24df7c86","sha256:ab504808d9bb39237f35f0f5ab128d4e0a8ed6ebd3377441ec29dda0de2c0665"],"state_sha256":"aabbc598690a5eaa0da2e3bbad6de4384b6f3ffb1a2544c4befba7ba2da06530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jM4rbkUqnQmdp0nwc6u+RzT0BGwM5vUSGBQ5c/sswRw9U7TrSwF7wAxIpQNrGXEs0dzVdF+gfwR1Rg0Jtv/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:26:30.901978Z","bundle_sha256":"10eaf44094dd22183befccd3cb9eacb4d44ec45193928098d8c73750c7a5902c"}}