{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M5ADHHBYUKLUY2U2YFMGRJMQZT","short_pith_number":"pith:M5ADHHBY","canonical_record":{"source":{"id":"1511.07193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-23T12:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"b91d4e10caa64068060ad8ceef1882b291efff46e18efa0b6fa4d6b460d87312","abstract_canon_sha256":"789eeab06f7674cc0a87aa45731d3429defce9dd84d7de9ea4f5abcd7684465c"},"schema_version":"1.0"},"canonical_sha256":"6740339c38a2974c6a9ac15868a590cce1e8abda5c586b066f080aa524ce6949","source":{"kind":"arxiv","id":"1511.07193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07193","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07193v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07193","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"M5ADHHBYUKLU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M5ADHHBYUKLUY2U2","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M5ADHHBY","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M5ADHHBYUKLUY2U2YFMGRJMQZT","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-23T12:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"b91d4e10caa64068060ad8ceef1882b291efff46e18efa0b6fa4d6b460d87312","abstract_canon_sha256":"789eeab06f7674cc0a87aa45731d3429defce9dd84d7de9ea4f5abcd7684465c"},"schema_version":"1.0"},"canonical_sha256":"6740339c38a2974c6a9ac15868a590cce1e8abda5c586b066f080aa524ce6949","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.991458Z","signature_b64":"/LAPJxWmxt73GHIlbQNkzbbbsJ41HSxw0rME0oaEKHXWDXFNGCXsZ2EJcyv6XAORq76DICr2MS6m9xBeMlxDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6740339c38a2974c6a9ac15868a590cce1e8abda5c586b066f080aa524ce6949","last_reissued_at":"2026-05-18T01:26:11.990824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.990824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07193","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7E1KpBCBq1pX2Dv4ZsK0nmF3sEsiKu65nbo0zHxlyw1Q+GVTCjjv0InZ/yeNGn4wZSvZyFIsZAv3ylvQHaa7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:13:14.570799Z"},"content_sha256":"2d59e8f007af7372ac38308f6abafcb2b5934bbaa99d1289f02edf0bcebc8218","schema_version":"1.0","event_id":"sha256:2d59e8f007af7372ac38308f6abafcb2b5934bbaa99d1289f02edf0bcebc8218"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M5ADHHBYUKLUY2U2YFMGRJMQZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An introduction to the analysis and implementation of sparse grid finite element methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Niall Madden, Stephen Russell","submitted_at":"2015-11-23T12:21:05Z","abstract_excerpt":"Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of freedom than their classical counterparts. After a brief discussion of the classical Galerkin finite element method with bilinear elements, we give a short analysis of what is probably the simplest sparse grid method: the two-scale technique of Lin et al. (2001). We then demonstrate how to extend this to a multiscale sparse grid method which, up to choice of ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07193","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"},"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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7+Hr/ZjE1L2agHq9bKWLpttAy5tAUCQtg7VY1K2Zs+VdnZsW7kj4npxI12ndEkD/uvEfC+mBVbrxwWHpb91DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:13:14.571713Z"},"content_sha256":"011b51a0fe5c65c18a0c72c78ba7ef0af2378db8484b7b7de7a27651bc70e920","schema_version":"1.0","event_id":"sha256:011b51a0fe5c65c18a0c72c78ba7ef0af2378db8484b7b7de7a27651bc70e920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/bundle.json","state_url":"https://pith.science/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/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-05-31T12:13:14Z","links":{"resolver":"https://pith.science/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT","bundle":"https://pith.science/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/bundle.json","state":"https://pith.science/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5ADHHBYUKLUY2U2YFMGRJMQZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M5ADHHBYUKLUY2U2YFMGRJMQZT","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":"789eeab06f7674cc0a87aa45731d3429defce9dd84d7de9ea4f5abcd7684465c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-23T12:21:05Z","title_canon_sha256":"b91d4e10caa64068060ad8ceef1882b291efff46e18efa0b6fa4d6b460d87312"},"schema_version":"1.0","source":{"id":"1511.07193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07193","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07193v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07193","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"M5ADHHBYUKLU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M5ADHHBYUKLUY2U2","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M5ADHHBY","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:011b51a0fe5c65c18a0c72c78ba7ef0af2378db8484b7b7de7a27651bc70e920","target":"graph","created_at":"2026-05-18T01:26:11Z","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"},"paper":{"abstract_excerpt":"Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of freedom than their classical counterparts. After a brief discussion of the classical Galerkin finite element method with bilinear elements, we give a short analysis of what is probably the simplest sparse grid method: the two-scale technique of Lin et al. (2001). We then demonstrate how to extend this to a multiscale sparse grid method which, up to choice of ba","authors_text":"Niall Madden, Stephen Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-23T12:21:05Z","title":"An introduction to the analysis and implementation of sparse grid finite element methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07193","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:2d59e8f007af7372ac38308f6abafcb2b5934bbaa99d1289f02edf0bcebc8218","target":"record","created_at":"2026-05-18T01:26:11Z","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":"789eeab06f7674cc0a87aa45731d3429defce9dd84d7de9ea4f5abcd7684465c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-23T12:21:05Z","title_canon_sha256":"b91d4e10caa64068060ad8ceef1882b291efff46e18efa0b6fa4d6b460d87312"},"schema_version":"1.0","source":{"id":"1511.07193","kind":"arxiv","version":1}},"canonical_sha256":"6740339c38a2974c6a9ac15868a590cce1e8abda5c586b066f080aa524ce6949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6740339c38a2974c6a9ac15868a590cce1e8abda5c586b066f080aa524ce6949","first_computed_at":"2026-05-18T01:26:11.990824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.990824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/LAPJxWmxt73GHIlbQNkzbbbsJ41HSxw0rME0oaEKHXWDXFNGCXsZ2EJcyv6XAORq76DICr2MS6m9xBeMlxDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.991458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d59e8f007af7372ac38308f6abafcb2b5934bbaa99d1289f02edf0bcebc8218","sha256:011b51a0fe5c65c18a0c72c78ba7ef0af2378db8484b7b7de7a27651bc70e920"],"state_sha256":"d74134ef981a45ce7a20f918640f778b04f5650d60ac184d23b9c0864c5d23d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxuHHJRV1FEe6zjMN9sQUctCnfo7KwUfWvk+guT0BD7Jf0+xIDO9TGJR++WSng+34Arw7XWWfgflYIbUpm7QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:13:14.576726Z","bundle_sha256":"6dca2b5036abe538f3e5cca1c5b99f7b5031e0d8d057514c30dc56e998afe72f"}}