{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CXJLPSDJAW7J3AH4VNZ3BFKZJX","short_pith_number":"pith:CXJLPSDJ","canonical_record":{"source":{"id":"1205.3022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T13:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"e7f360e80fa69a2f155fe198a324a2c445776a625d713cdca06874eb0d1d7323","abstract_canon_sha256":"3cd3010253165e6df27a7722eb196366dbcc0a72e0477bfee5de73802c70bacd"},"schema_version":"1.0"},"canonical_sha256":"15d2b7c86905be9d80fcab73b095594ddbd904f7d12efd7d69ed030fdc8d85c4","source":{"kind":"arxiv","id":"1205.3022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3022","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3022v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3022","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"CXJLPSDJAW7J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CXJLPSDJAW7J3AH4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CXJLPSDJ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CXJLPSDJAW7J3AH4VNZ3BFKZJX","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T13:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"e7f360e80fa69a2f155fe198a324a2c445776a625d713cdca06874eb0d1d7323","abstract_canon_sha256":"3cd3010253165e6df27a7722eb196366dbcc0a72e0477bfee5de73802c70bacd"},"schema_version":"1.0"},"canonical_sha256":"15d2b7c86905be9d80fcab73b095594ddbd904f7d12efd7d69ed030fdc8d85c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:45.456951Z","signature_b64":"uqA56Bc6YQOGA3Ltgwkx7OHZQgzp5Fbcl674mN8VqqSYJ1w56NjBPaStrp4CJqBuHZJcEfSjyFI2LdsDrvs4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d2b7c86905be9d80fcab73b095594ddbd904f7d12efd7d69ed030fdc8d85c4","last_reissued_at":"2026-05-18T03:55:45.453695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:45.453695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3022","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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIl9waLn2wYtLcFQndVSAzFXZCe/XUj0fk6/y/zdcU3krd/LM1g1rjGIaFy3dwq2qSa85SyEaOJS7d7tFN5HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:43:59.256914Z"},"content_sha256":"dc31abd3ab2368c6cf9e188f5b2c4c7f9cb777ac3a925bdceb67d56db76d5919","schema_version":"1.0","event_id":"sha256:dc31abd3ab2368c6cf9e188f5b2c4c7f9cb777ac3a925bdceb67d56db76d5919"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CXJLPSDJAW7J3AH4VNZ3BFKZJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Data Structures for Multi-Adaptive Time-Stepping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anders Logg, Johan Jansson","submitted_at":"2012-05-14T13:37:50Z","abstract_excerpt":"Multi-adaptive Galerkin methods are extensions of the standard continuous and discontinuous Galerkin methods for the numerical solution of initial value problems for ordinary or partial differential equations. In particular, the multi-adaptive methods allow individual and adaptive time steps to be used for different components or in different regions of space. We present algorithms for efficient multi-adaptive time-stepping, including the recursive construction of time slabs and adaptive time step selection. We also present data structures for efficient storage and interpolation of the multi-a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3022","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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEzYoQsZNbUKzlyellprzdXTkwmeVUkCAMGLKXfpAy5G8dvzjuckwj9MleB8xGll630cR+KRImA/GN6DJGt2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:43:59.257713Z"},"content_sha256":"477c641ea2fc0325d17113c2db1bbc7cfb9cd751ea3cb5618105f499477ffa14","schema_version":"1.0","event_id":"sha256:477c641ea2fc0325d17113c2db1bbc7cfb9cd751ea3cb5618105f499477ffa14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/bundle.json","state_url":"https://pith.science/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/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-31T07:43:59Z","links":{"resolver":"https://pith.science/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX","bundle":"https://pith.science/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/bundle.json","state":"https://pith.science/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXJLPSDJAW7J3AH4VNZ3BFKZJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CXJLPSDJAW7J3AH4VNZ3BFKZJX","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":"3cd3010253165e6df27a7722eb196366dbcc0a72e0477bfee5de73802c70bacd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T13:37:50Z","title_canon_sha256":"e7f360e80fa69a2f155fe198a324a2c445776a625d713cdca06874eb0d1d7323"},"schema_version":"1.0","source":{"id":"1205.3022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3022","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3022v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3022","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"CXJLPSDJAW7J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CXJLPSDJAW7J3AH4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CXJLPSDJ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:477c641ea2fc0325d17113c2db1bbc7cfb9cd751ea3cb5618105f499477ffa14","target":"graph","created_at":"2026-05-18T03:55:45Z","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":"Multi-adaptive Galerkin methods are extensions of the standard continuous and discontinuous Galerkin methods for the numerical solution of initial value problems for ordinary or partial differential equations. In particular, the multi-adaptive methods allow individual and adaptive time steps to be used for different components or in different regions of space. We present algorithms for efficient multi-adaptive time-stepping, including the recursive construction of time slabs and adaptive time step selection. We also present data structures for efficient storage and interpolation of the multi-a","authors_text":"Anders Logg, Johan Jansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T13:37:50Z","title":"Algorithms and Data Structures for Multi-Adaptive Time-Stepping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3022","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:dc31abd3ab2368c6cf9e188f5b2c4c7f9cb777ac3a925bdceb67d56db76d5919","target":"record","created_at":"2026-05-18T03:55:45Z","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":"3cd3010253165e6df27a7722eb196366dbcc0a72e0477bfee5de73802c70bacd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T13:37:50Z","title_canon_sha256":"e7f360e80fa69a2f155fe198a324a2c445776a625d713cdca06874eb0d1d7323"},"schema_version":"1.0","source":{"id":"1205.3022","kind":"arxiv","version":1}},"canonical_sha256":"15d2b7c86905be9d80fcab73b095594ddbd904f7d12efd7d69ed030fdc8d85c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d2b7c86905be9d80fcab73b095594ddbd904f7d12efd7d69ed030fdc8d85c4","first_computed_at":"2026-05-18T03:55:45.453695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:45.453695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uqA56Bc6YQOGA3Ltgwkx7OHZQgzp5Fbcl674mN8VqqSYJ1w56NjBPaStrp4CJqBuHZJcEfSjyFI2LdsDrvs4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:45.456951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc31abd3ab2368c6cf9e188f5b2c4c7f9cb777ac3a925bdceb67d56db76d5919","sha256:477c641ea2fc0325d17113c2db1bbc7cfb9cd751ea3cb5618105f499477ffa14"],"state_sha256":"ddfa9dd785774305ff090d675e438b6e8a23774b3fb3506c1d60b44ce1e3789a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/3DqodxTPNA3/3T1NQ+OyyJcTBAeilaWB0BkYS/uZ3P0Y9tVVwM+JWDIVlKZERcMQGKFbYDeOSg3nCH+l6QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:43:59.261675Z","bundle_sha256":"02db1504b2fea74036980f655fa732ec9f5193b8b4d743a67bc8e5402da30a91"}}