{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6IONY67VZGMU254EYHLBKJEU7J","short_pith_number":"pith:6IONY67V","canonical_record":{"source":{"id":"2508.05020","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-07T04:14:42Z","cross_cats_sorted":["cs.CE","cs.MS"],"title_canon_sha256":"598e0788255e9d7a24be58ac607707fd09eae2656473e6d559ebbd81c340accf","abstract_canon_sha256":"ca4c4911194e122fb002c195650350b09a22508082542986d0a985d26f6151dd"},"schema_version":"1.0"},"canonical_sha256":"f21cdc7bf5c9994d7784c1d6152494fa5d7a60d747d9fff76f36965f06ffedfa","source":{"kind":"arxiv","id":"2508.05020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05020","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05020v1","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05020","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_12","alias_value":"6IONY67VZGMU","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_16","alias_value":"6IONY67VZGMU254E","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_8","alias_value":"6IONY67V","created_at":"2026-07-05T11:50:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6IONY67VZGMU254EYHLBKJEU7J","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05020","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-07T04:14:42Z","cross_cats_sorted":["cs.CE","cs.MS"],"title_canon_sha256":"598e0788255e9d7a24be58ac607707fd09eae2656473e6d559ebbd81c340accf","abstract_canon_sha256":"ca4c4911194e122fb002c195650350b09a22508082542986d0a985d26f6151dd"},"schema_version":"1.0"},"canonical_sha256":"f21cdc7bf5c9994d7784c1d6152494fa5d7a60d747d9fff76f36965f06ffedfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:05.746100Z","signature_b64":"2Y7q7y528KkDW/M/QV/RQCkw4uU48c9950hklIfXBAa0rzGgevfRy/jVkKOrmbZcX6MDsI9IJUcywETVoNa/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f21cdc7bf5c9994d7784c1d6152494fa5d7a60d747d9fff76f36965f06ffedfa","last_reissued_at":"2026-07-05T11:50:05.745636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:05.745636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05020","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-07-05T11:50:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a2eImxO4abrIoiwaJpgV1PRyDfUfFSxeZrq22UmQ+huJP/DdEWkP35f8GcHBk8BkATJkq5fRkHD+YSgcOFfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:04:29.064177Z"},"content_sha256":"fe491d8216982115a588203dfda0cf12b7b516e44284404fdd8964dcf2a3b72b","schema_version":"1.0","event_id":"sha256:fe491d8216982115a588203dfda0cf12b7b516e44284404fdd8964dcf2a3b72b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6IONY67VZGMU254EYHLBKJEU7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task-Based Programming for Adaptive Mesh Refinement in Compressible Flow Simulations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","cs.MS"],"primary_cat":"cs.DC","authors_text":"Alex Aiken, Anjiang Wei, Elliott Slaughter, Hang Song, Mert Hidayetoglu, Sanjiva K. Lele","submitted_at":"2025-08-07T04:14:42Z","abstract_excerpt":"High-order solvers for compressible flows are vital in scientific applications. Adaptive mesh refinement (AMR) is a key technique for reducing computational cost by concentrating resolution in regions of interest. In this work, we develop an AMR-based numerical solver using Regent, a high-level programming language for the Legion programming model. We address several challenges associated with implementing AMR in Regent. These include dynamic data structures for patch refinement/coarsening, mesh validity enforcement, and reducing task launch overhead via task fusion. Experimental results show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05020","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/2508.05020/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-07-05T11:50:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYWnT13Jz+n6FmSCzqPCa7l3BiXeXWUH78Nnd/DCUw007Q3Lty8+8J+B+bnKu800ws+eSvlecrl3rLBt1j5YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:04:29.064683Z"},"content_sha256":"1dbbdcb23ed2411764e3cb71c194ce6dbfd08df00e8908c9b1c01a19f847eea3","schema_version":"1.0","event_id":"sha256:1dbbdcb23ed2411764e3cb71c194ce6dbfd08df00e8908c9b1c01a19f847eea3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IONY67VZGMU254EYHLBKJEU7J/bundle.json","state_url":"https://pith.science/pith/6IONY67VZGMU254EYHLBKJEU7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IONY67VZGMU254EYHLBKJEU7J/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-08-12T14:04:29Z","links":{"resolver":"https://pith.science/pith/6IONY67VZGMU254EYHLBKJEU7J","bundle":"https://pith.science/pith/6IONY67VZGMU254EYHLBKJEU7J/bundle.json","state":"https://pith.science/pith/6IONY67VZGMU254EYHLBKJEU7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IONY67VZGMU254EYHLBKJEU7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6IONY67VZGMU254EYHLBKJEU7J","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":"ca4c4911194e122fb002c195650350b09a22508082542986d0a985d26f6151dd","cross_cats_sorted":["cs.CE","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-07T04:14:42Z","title_canon_sha256":"598e0788255e9d7a24be58ac607707fd09eae2656473e6d559ebbd81c340accf"},"schema_version":"1.0","source":{"id":"2508.05020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05020","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05020v1","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05020","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_12","alias_value":"6IONY67VZGMU","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_16","alias_value":"6IONY67VZGMU254E","created_at":"2026-07-05T11:50:05Z"},{"alias_kind":"pith_short_8","alias_value":"6IONY67V","created_at":"2026-07-05T11:50:05Z"}],"graph_snapshots":[{"event_id":"sha256:1dbbdcb23ed2411764e3cb71c194ce6dbfd08df00e8908c9b1c01a19f847eea3","target":"graph","created_at":"2026-07-05T11:50:05Z","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/2508.05020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-order solvers for compressible flows are vital in scientific applications. Adaptive mesh refinement (AMR) is a key technique for reducing computational cost by concentrating resolution in regions of interest. In this work, we develop an AMR-based numerical solver using Regent, a high-level programming language for the Legion programming model. We address several challenges associated with implementing AMR in Regent. These include dynamic data structures for patch refinement/coarsening, mesh validity enforcement, and reducing task launch overhead via task fusion. Experimental results show ","authors_text":"Alex Aiken, Anjiang Wei, Elliott Slaughter, Hang Song, Mert Hidayetoglu, Sanjiva K. Lele","cross_cats":["cs.CE","cs.MS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-07T04:14:42Z","title":"Task-Based Programming for Adaptive Mesh Refinement in Compressible Flow Simulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05020","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:fe491d8216982115a588203dfda0cf12b7b516e44284404fdd8964dcf2a3b72b","target":"record","created_at":"2026-07-05T11:50:05Z","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":"ca4c4911194e122fb002c195650350b09a22508082542986d0a985d26f6151dd","cross_cats_sorted":["cs.CE","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-07T04:14:42Z","title_canon_sha256":"598e0788255e9d7a24be58ac607707fd09eae2656473e6d559ebbd81c340accf"},"schema_version":"1.0","source":{"id":"2508.05020","kind":"arxiv","version":1}},"canonical_sha256":"f21cdc7bf5c9994d7784c1d6152494fa5d7a60d747d9fff76f36965f06ffedfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f21cdc7bf5c9994d7784c1d6152494fa5d7a60d747d9fff76f36965f06ffedfa","first_computed_at":"2026-07-05T11:50:05.745636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:05.745636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Y7q7y528KkDW/M/QV/RQCkw4uU48c9950hklIfXBAa0rzGgevfRy/jVkKOrmbZcX6MDsI9IJUcywETVoNa/Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:05.746100Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe491d8216982115a588203dfda0cf12b7b516e44284404fdd8964dcf2a3b72b","sha256:1dbbdcb23ed2411764e3cb71c194ce6dbfd08df00e8908c9b1c01a19f847eea3"],"state_sha256":"e8e4f5250d4827e8ac9ef7a03573133b1e6fcd63db7791b1e5e09596c98ce961"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoM0KwKFgKbg8koQVPE9h+qUyzsIZC71fkdNtg6GYSPkSNNVXlBrP2bOxVM1noDqBfUdi92/SSYv1o6f1YxqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:04:29.069733Z","bundle_sha256":"5544272cb4a5e3139c03f624ffc4f0bf428a1ab650fdd50fc12e188e9ab43cc0"}}