{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DEFF5ROH4RJKTBEW4UFAM7UHSZ","short_pith_number":"pith:DEFF5ROH","canonical_record":{"source":{"id":"1810.06670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T20:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"a8a590e5da887d754a930d17bf682cbb457b15c478268f74128d26dd49228c18","abstract_canon_sha256":"b4ef00891bed2cb6acb8461db77b5bd0eb177ac930f4259ff8a4e806bf2783ab"},"schema_version":"1.0"},"canonical_sha256":"190a5ec5c7e452a98496e50a067e879673e2a1437e6154dc595f230dc8fe67a1","source":{"kind":"arxiv","id":"1810.06670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06670","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06670v1","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06670","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"DEFF5ROH4RJK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DEFF5ROH4RJKTBEW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DEFF5ROH","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DEFF5ROH4RJKTBEW4UFAM7UHSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T20:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"a8a590e5da887d754a930d17bf682cbb457b15c478268f74128d26dd49228c18","abstract_canon_sha256":"b4ef00891bed2cb6acb8461db77b5bd0eb177ac930f4259ff8a4e806bf2783ab"},"schema_version":"1.0"},"canonical_sha256":"190a5ec5c7e452a98496e50a067e879673e2a1437e6154dc595f230dc8fe67a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:12.014938Z","signature_b64":"pJ25QD1iURHG1mhGUyQp/LmcdhcDJ6lswKiSqhh8ePnIcPTrJg19j3s3N0Lb3gEMHtgJzsrftKo5P0Ws1R9ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"190a5ec5c7e452a98496e50a067e879673e2a1437e6154dc595f230dc8fe67a1","last_reissued_at":"2026-05-18T00:03:12.014226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:12.014226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06670","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-18T00:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDusqEMIQYFHpaWGzAPQTkRMAkJZk9v0ilgs/vhlHZFXVOxdOSz0DFnpC1bEWqSY1pMFzhYfJ4RRUtKL+99NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:45:02.229149Z"},"content_sha256":"ad6a7c220f40d330af5e56010b92f572702b29fe599d5292d93865a987d42ed3","schema_version":"1.0","event_id":"sha256:ad6a7c220f40d330af5e56010b92f572702b29fe599d5292d93865a987d42ed3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DEFF5ROH4RJKTBEW4UFAM7UHSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new embedded variable stepsize, variable order family of low computational complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ahmet Guzel, Victor DeCaria, William Layton, Yi Li","submitted_at":"2018-10-15T20:34:17Z","abstract_excerpt":"Variable Stepsize Variable Order (VSVO) methods are the methods of choice to efficiently solve a wide range of ODEs with minimal work and assured accuracy. However, VSVO methods have limited impact in timestepping methods in complex applications due to their computational complexity and the difficulty to implement them in legacy code. We introduce a family of implicit, embedded, VSVO methods that require only one BDF solve at each time step followed by adding linear combinations of the solution at previous time levels. In particular, we construct implicit and linearly implicit VSVO methods of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06670","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-18T00:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZRZijZSINy08wRiwVyDsZScTWPleBdn2JydlIU0AmHpy4S4PJaFmqOOmO22sJd+jSIod2NXWWx5PG+zvk4UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:45:02.229632Z"},"content_sha256":"bd471356ddacc98f8c75ab0a30e51378ea063ed41b694f8fb284b4b246078b94","schema_version":"1.0","event_id":"sha256:bd471356ddacc98f8c75ab0a30e51378ea063ed41b694f8fb284b4b246078b94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/bundle.json","state_url":"https://pith.science/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/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-22T03:45:02Z","links":{"resolver":"https://pith.science/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ","bundle":"https://pith.science/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/bundle.json","state":"https://pith.science/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEFF5ROH4RJKTBEW4UFAM7UHSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DEFF5ROH4RJKTBEW4UFAM7UHSZ","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":"b4ef00891bed2cb6acb8461db77b5bd0eb177ac930f4259ff8a4e806bf2783ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T20:34:17Z","title_canon_sha256":"a8a590e5da887d754a930d17bf682cbb457b15c478268f74128d26dd49228c18"},"schema_version":"1.0","source":{"id":"1810.06670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06670","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06670v1","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06670","created_at":"2026-05-18T00:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"DEFF5ROH4RJK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DEFF5ROH4RJKTBEW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DEFF5ROH","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:bd471356ddacc98f8c75ab0a30e51378ea063ed41b694f8fb284b4b246078b94","target":"graph","created_at":"2026-05-18T00:03:12Z","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":"Variable Stepsize Variable Order (VSVO) methods are the methods of choice to efficiently solve a wide range of ODEs with minimal work and assured accuracy. However, VSVO methods have limited impact in timestepping methods in complex applications due to their computational complexity and the difficulty to implement them in legacy code. We introduce a family of implicit, embedded, VSVO methods that require only one BDF solve at each time step followed by adding linear combinations of the solution at previous time levels. In particular, we construct implicit and linearly implicit VSVO methods of ","authors_text":"Ahmet Guzel, Victor DeCaria, William Layton, Yi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T20:34:17Z","title":"A new embedded variable stepsize, variable order family of low computational complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06670","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:ad6a7c220f40d330af5e56010b92f572702b29fe599d5292d93865a987d42ed3","target":"record","created_at":"2026-05-18T00:03:12Z","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":"b4ef00891bed2cb6acb8461db77b5bd0eb177ac930f4259ff8a4e806bf2783ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T20:34:17Z","title_canon_sha256":"a8a590e5da887d754a930d17bf682cbb457b15c478268f74128d26dd49228c18"},"schema_version":"1.0","source":{"id":"1810.06670","kind":"arxiv","version":1}},"canonical_sha256":"190a5ec5c7e452a98496e50a067e879673e2a1437e6154dc595f230dc8fe67a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"190a5ec5c7e452a98496e50a067e879673e2a1437e6154dc595f230dc8fe67a1","first_computed_at":"2026-05-18T00:03:12.014226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:12.014226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJ25QD1iURHG1mhGUyQp/LmcdhcDJ6lswKiSqhh8ePnIcPTrJg19j3s3N0Lb3gEMHtgJzsrftKo5P0Ws1R9ADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:12.014938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6a7c220f40d330af5e56010b92f572702b29fe599d5292d93865a987d42ed3","sha256:bd471356ddacc98f8c75ab0a30e51378ea063ed41b694f8fb284b4b246078b94"],"state_sha256":"7a63ae209f410971e28a35d8623a36b2cc68272d1cf3998f6181d6b978cdc5e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psJzr4rr8cKd868Flnbua0d3FkXGUsQTWfFaIia9rABA6pqCzshaa7JwQJ/U2awHUkPjhuOQvwY4CGaRpZg/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:45:02.232149Z","bundle_sha256":"bce0cfd44327e6e814ab31cd3c214732b327534fac5fe9f3f4871cd91567928c"}}