{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PRH5QZOIMZP77X33SYXL6HEDUH","short_pith_number":"pith:PRH5QZOI","schema_version":"1.0","canonical_sha256":"7c4fd865c8665fffdf7b962ebf1c83a1c05eae7b29fdc26ad608ebbd2056c7df","source":{"kind":"arxiv","id":"1203.4032","version":1},"attestation_state":"computed","paper":{"title":"Fast summation by interval clustering for an evolution equation with memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"William McLean","submitted_at":"2012-03-19T04:09:16Z","abstract_excerpt":"We solve a fractional diffusion equation using a piecewise-constant, discontinuous Galerkin method in time combined with a continuous, piecewise-linear finite element method in space. If there are $N$ time levels and $M$ spatial degrees of freedom, then a direct implementation of this method requires $O(N^2M)$ operations and $O(NM)$ active memory locations, owing to the presence of a memory term: at each time step, the discrete evolution equation involves a sum over \\emph{all} previous time levels. We show how the computational cost can be reduced to $O(MN\\log N)$ operations and $O(M\\log N)$ a"},"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":"1203.4032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-19T04:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"1d713c3cff81b20b014e82880ac7993ad555f55c16148571ba1adedfdfc8e30d","abstract_canon_sha256":"e20d937afe278f523f8f1d4b6dd8194bda6c049b8ec2d64ecc882c8ff7a08a75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:39.843498Z","signature_b64":"/5kwXhVK13QKUdMMuQYU3LPZW24u/9S3ixh/pXJqzGjYe4wlnQLEf0tpIWskMso9wyIQypx1Gk3P2tO1yDDcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c4fd865c8665fffdf7b962ebf1c83a1c05eae7b29fdc26ad608ebbd2056c7df","last_reissued_at":"2026-05-18T01:21:39.843001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:39.843001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast summation by interval clustering for an evolution equation with memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"William McLean","submitted_at":"2012-03-19T04:09:16Z","abstract_excerpt":"We solve a fractional diffusion equation using a piecewise-constant, discontinuous Galerkin method in time combined with a continuous, piecewise-linear finite element method in space. If there are $N$ time levels and $M$ spatial degrees of freedom, then a direct implementation of this method requires $O(N^2M)$ operations and $O(NM)$ active memory locations, owing to the presence of a memory term: at each time step, the discrete evolution equation involves a sum over \\emph{all} previous time levels. We show how the computational cost can be reduced to $O(MN\\log N)$ operations and $O(M\\log N)$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4032","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":""},"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":"1203.4032","created_at":"2026-05-18T01:21:39.843072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4032v1","created_at":"2026-05-18T01:21:39.843072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4032","created_at":"2026-05-18T01:21:39.843072+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRH5QZOIMZP7","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRH5QZOIMZP77X33","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRH5QZOI","created_at":"2026-05-18T12:27:18.751474+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/PRH5QZOIMZP77X33SYXL6HEDUH","json":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH.json","graph_json":"https://pith.science/api/pith-number/PRH5QZOIMZP77X33SYXL6HEDUH/graph.json","events_json":"https://pith.science/api/pith-number/PRH5QZOIMZP77X33SYXL6HEDUH/events.json","paper":"https://pith.science/paper/PRH5QZOI"},"agent_actions":{"view_html":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH","download_json":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH.json","view_paper":"https://pith.science/paper/PRH5QZOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4032&json=true","fetch_graph":"https://pith.science/api/pith-number/PRH5QZOIMZP77X33SYXL6HEDUH/graph.json","fetch_events":"https://pith.science/api/pith-number/PRH5QZOIMZP77X33SYXL6HEDUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH/action/storage_attestation","attest_author":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH/action/author_attestation","sign_citation":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH/action/citation_signature","submit_replication":"https://pith.science/pith/PRH5QZOIMZP77X33SYXL6HEDUH/action/replication_record"}},"created_at":"2026-05-18T01:21:39.843072+00:00","updated_at":"2026-05-18T01:21:39.843072+00:00"}