{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:NZRF546TKONPETH7NBAOB4532F","short_pith_number":"pith:NZRF546T","canonical_record":{"source":{"id":"math/0611168","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2006-11-07T09:34:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0bd8732c436cab832e78f98eea7671cb702ddc87daf52edcbd2ab78f6fca6cc3","abstract_canon_sha256":"952b276e446056f70545ae1672a8c839b75c021ed7befbc9e9f907abdfa55507"},"schema_version":"1.0"},"canonical_sha256":"6e625ef3d3539af24cff6840e0f3bbd171b6bf673ef72555e2073aa359473da1","source":{"kind":"arxiv","id":"math/0611168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0611168","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"math/0611168v1","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611168","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NZRF546TKONP","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_16","alias_value":"NZRF546TKONPETH7","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_8","alias_value":"NZRF546T","created_at":"2026-06-03T22:06:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:NZRF546TKONPETH7NBAOB4532F","target":"record","payload":{"canonical_record":{"source":{"id":"math/0611168","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2006-11-07T09:34:12Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0bd8732c436cab832e78f98eea7671cb702ddc87daf52edcbd2ab78f6fca6cc3","abstract_canon_sha256":"952b276e446056f70545ae1672a8c839b75c021ed7befbc9e9f907abdfa55507"},"schema_version":"1.0"},"canonical_sha256":"6e625ef3d3539af24cff6840e0f3bbd171b6bf673ef72555e2073aa359473da1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:21.120022Z","signature_b64":"bhYz5GKqGSqdxy9rQTt8j7QmKs2XnT3PxWi7fpFT2iqZ5VCrLHpMyBZn1TZhVdai8mwAJZjlg5LKkBuXeHbdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e625ef3d3539af24cff6840e0f3bbd171b6bf673ef72555e2073aa359473da1","last_reissued_at":"2026-06-03T22:06:21.119562Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:21.119562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0611168","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-06-03T22:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omGWceiP/NKjyIpfABgrwmQrKGNae7DHOmL5KNyxhhwNNCdrA22lRqLmtlyClGysxKtAy9ThYWGXAcVRH2rpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:50:46.515146Z"},"content_sha256":"a62bb335f96306699b2378f015cb0b090e8327ac6874aafeb11367efa8263920","schema_version":"1.0","event_id":"sha256:a62bb335f96306699b2378f015cb0b090e8327ac6874aafeb11367efa8263920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:NZRF546TKONPETH7NBAOB4532F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive, Fast and Oblivious Convolution in Evolution Equations with Memory","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Achim Sch\\\"adle, Christian Lubich, Mar\\'ia L\\'opez-Fern\\'andez","submitted_at":"2006-11-07T09:34:12Z","abstract_excerpt":"To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log(N)) operations and O(log(N)) active memory, in place of O(N^2) operations and O(N) memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a bl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611168","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/math/0611168/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-06-03T22:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJMLrFrM2TtrsFGiZJcJz4gDAjchgBebgOZZxBH6CcCY7TsNALp5dGlTplDGCBKUBtKY4bav4vi/JH1P+owSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:50:46.515818Z"},"content_sha256":"c7c47850ac4c070b074220c69588a64fbc4d265e80291272b58a3d5c2176d8a3","schema_version":"1.0","event_id":"sha256:c7c47850ac4c070b074220c69588a64fbc4d265e80291272b58a3d5c2176d8a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZRF546TKONPETH7NBAOB4532F/bundle.json","state_url":"https://pith.science/pith/NZRF546TKONPETH7NBAOB4532F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZRF546TKONPETH7NBAOB4532F/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-05T04:50:46Z","links":{"resolver":"https://pith.science/pith/NZRF546TKONPETH7NBAOB4532F","bundle":"https://pith.science/pith/NZRF546TKONPETH7NBAOB4532F/bundle.json","state":"https://pith.science/pith/NZRF546TKONPETH7NBAOB4532F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZRF546TKONPETH7NBAOB4532F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:NZRF546TKONPETH7NBAOB4532F","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":"952b276e446056f70545ae1672a8c839b75c021ed7befbc9e9f907abdfa55507","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2006-11-07T09:34:12Z","title_canon_sha256":"0bd8732c436cab832e78f98eea7671cb702ddc87daf52edcbd2ab78f6fca6cc3"},"schema_version":"1.0","source":{"id":"math/0611168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0611168","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"math/0611168v1","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611168","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NZRF546TKONP","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_16","alias_value":"NZRF546TKONPETH7","created_at":"2026-06-03T22:06:21Z"},{"alias_kind":"pith_short_8","alias_value":"NZRF546T","created_at":"2026-06-03T22:06:21Z"}],"graph_snapshots":[{"event_id":"sha256:c7c47850ac4c070b074220c69588a64fbc4d265e80291272b58a3d5c2176d8a3","target":"graph","created_at":"2026-06-03T22:06:21Z","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/math/0611168/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log(N)) operations and O(log(N)) active memory, in place of O(N^2) operations and O(N) memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a bl","authors_text":"Achim Sch\\\"adle, Christian Lubich, Mar\\'ia L\\'opez-Fern\\'andez","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2006-11-07T09:34:12Z","title":"Adaptive, Fast and Oblivious Convolution in Evolution Equations with Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611168","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:a62bb335f96306699b2378f015cb0b090e8327ac6874aafeb11367efa8263920","target":"record","created_at":"2026-06-03T22:06:21Z","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":"952b276e446056f70545ae1672a8c839b75c021ed7befbc9e9f907abdfa55507","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2006-11-07T09:34:12Z","title_canon_sha256":"0bd8732c436cab832e78f98eea7671cb702ddc87daf52edcbd2ab78f6fca6cc3"},"schema_version":"1.0","source":{"id":"math/0611168","kind":"arxiv","version":1}},"canonical_sha256":"6e625ef3d3539af24cff6840e0f3bbd171b6bf673ef72555e2073aa359473da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e625ef3d3539af24cff6840e0f3bbd171b6bf673ef72555e2073aa359473da1","first_computed_at":"2026-06-03T22:06:21.119562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:21.119562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bhYz5GKqGSqdxy9rQTt8j7QmKs2XnT3PxWi7fpFT2iqZ5VCrLHpMyBZn1TZhVdai8mwAJZjlg5LKkBuXeHbdAw==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:21.120022Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0611168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a62bb335f96306699b2378f015cb0b090e8327ac6874aafeb11367efa8263920","sha256:c7c47850ac4c070b074220c69588a64fbc4d265e80291272b58a3d5c2176d8a3"],"state_sha256":"6b902f1bdcd8b04a422adc7c7de334cf483b14cb507687172323f62321114c47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRrnjFw9454tT4McvF+X9xS3PPLPvHKlGlQKqnQlMr87pjHPaXIKzUoDf+DPOLpQwVvOevRhmJ1c5NN1ppdYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:50:46.519259Z","bundle_sha256":"ccaf19c32f4b1ba672ced5d7a95e25c522e4d4df5baeed066b85dda9b471b9e5"}}