{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A22T55SB3YUDUBDWA4G345P4U4","short_pith_number":"pith:A22T55SB","canonical_record":{"source":{"id":"2607.28104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-30T12:12:42Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"072c196ed1ec3b0dcc51b35711de8cc5eca9d4974c863c3aeca51fb430597639","abstract_canon_sha256":"bbc044c8c29a7eeac08cb628695f5774d43d8795e73fbe235604d7c63370e606"},"schema_version":"1.0"},"canonical_sha256":"06b53ef641de283a0476070dbe75fca71b076b0d8817430d361746e3e3208ebc","source":{"kind":"arxiv","id":"2607.28104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28104","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28104v1","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28104","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"A22T55SB3YUD","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_16","alias_value":"A22T55SB3YUDUBDW","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_8","alias_value":"A22T55SB","created_at":"2026-07-31T01:35:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A22T55SB3YUDUBDWA4G345P4U4","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-30T12:12:42Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"072c196ed1ec3b0dcc51b35711de8cc5eca9d4974c863c3aeca51fb430597639","abstract_canon_sha256":"bbc044c8c29a7eeac08cb628695f5774d43d8795e73fbe235604d7c63370e606"},"schema_version":"1.0"},"canonical_sha256":"06b53ef641de283a0476070dbe75fca71b076b0d8817430d361746e3e3208ebc","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06b53ef641de283a0476070dbe75fca71b076b0d8817430d361746e3e3208ebc","last_reissued_at":"2026-07-31T01:35:46.422578Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:46.422578Z"},"source_kind":"arxiv","source_id":"2607.28104","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-31T01:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpMTLJdWoLhgcQVmhVpF5Je3qepP1e4KRAI+kMnFpwAIbZt8iBsjRApyv7yX/wXGclRi2fB0rrFJBbbeYzubDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T06:50:09.939742Z"},"content_sha256":"19dc06fcd5f480b4eafa5165dbc0f9f9fa20b9a047da19c509a5e9a8d23c8197","schema_version":"1.0","event_id":"sha256:19dc06fcd5f480b4eafa5165dbc0f9f9fa20b9a047da19c509a5e9a8d23c8197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A22T55SB3YUDUBDWA4G345P4U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive Finite Element Method for Marker-Driven Level-Set Transport on Hierarchical Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrea Chierici, Eugenio Aulisa, Giacomo Barbi, Samuele Baldini, Sandro Manservisi","submitted_at":"2026-07-30T12:12:42Z","abstract_excerpt":"This work presents a new adaptive finite-element framework for level-set transport, achieving high accuracy in kinematic interface transport problems relevant to interface-capturing methods for two-phase flows while reducing computational cost. This framework accommodates dynamic refinement and coarsening, and is compatible with standard finite-element data structures. The algorithm is applicable to both structured and unstructured discretizations in two and three dimensions. The method uses a tree-based hierarchical mesh with dynamic local refinement that tracks the evolving interface, concen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28104","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/2607.28104/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-31T01:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZn8Yca9Wy1JnB8xGvrfeJVctjyKOQZLUXA5aG9CYXCnpNBHA9LZ9GmQA700OjwN/WfNzzfmvmlKSjPb4GOpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T06:50:09.940319Z"},"content_sha256":"bafe5b34dc212ae1c75b9d470d00a51e0eaec74e50f12d569c844aeeaff1a829","schema_version":"1.0","event_id":"sha256:bafe5b34dc212ae1c75b9d470d00a51e0eaec74e50f12d569c844aeeaff1a829"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:A22T55SB3YUDUBDWA4G345P4U4","target":"integrity","payload":{"note":"Identifier '10.1007/s10915-019-01053-6' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"V. A. Ramanuj, R. Sankaran, High order anchoring and reinitializ ation of level set function for simulating interface motion, Journal of Scientific Comp uting 81 (3) (2019) 1963–1986. doi:10.1007/s10915-019-01053-6","arxiv_id":"2607.28104","detector":"doi_compliance","evidence":{"doi":"10.1007/s10915-019-01053-6","arxiv_id":null,"ref_index":37,"raw_excerpt":"V. A. Ramanuj, R. Sankaran, High order anchoring and reinitializ ation of level set function for simulating interface motion, Journal of Scientific Comp uting 81 (3) (2019) 1963–1986. doi:10.1007/s10915-019-01053-6","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":37,"audited_at":"2026-07-31T17:51:40.451836Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10915-019-01053-6","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e129d1321bc6353aa6b5b6233fda9e7f2804f5ee197b4b8d1e92fa644cee1e2f","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14458,"payload_sha256":"40fc35ca7e48d7b7c6397bd7c72f15e9d4471d07f5c69b1ed5f30ae4980f83ec","signature_b64":"bbt/9tunA4DWVVJFUYKBZV9VhsQFyQTXLee/9OCH8Lc/TSGutubcLjGgsrNsR7uZ/qHm4GSOYruOGCoB75P5Cw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T17:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTLjk/Lh465j45CXSXg7Y8g5Dqub/Neqq5zgUfA7pxA7WSoeYwxQDjgzR9IYIvsq4GMyhTGOHhPYSKYTs37zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T06:50:10.007251Z"},"content_sha256":"8facd92e4eaa216771f44d69f50390f75fa8dec26d0589d2c753899a76b9b14f","schema_version":"1.0","event_id":"sha256:8facd92e4eaa216771f44d69f50390f75fa8dec26d0589d2c753899a76b9b14f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A22T55SB3YUDUBDWA4G345P4U4/bundle.json","state_url":"https://pith.science/pith/A22T55SB3YUDUBDWA4G345P4U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A22T55SB3YUDUBDWA4G345P4U4/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-03T06:50:10Z","links":{"resolver":"https://pith.science/pith/A22T55SB3YUDUBDWA4G345P4U4","bundle":"https://pith.science/pith/A22T55SB3YUDUBDWA4G345P4U4/bundle.json","state":"https://pith.science/pith/A22T55SB3YUDUBDWA4G345P4U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A22T55SB3YUDUBDWA4G345P4U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A22T55SB3YUDUBDWA4G345P4U4","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bbc044c8c29a7eeac08cb628695f5774d43d8795e73fbe235604d7c63370e606","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-30T12:12:42Z","title_canon_sha256":"072c196ed1ec3b0dcc51b35711de8cc5eca9d4974c863c3aeca51fb430597639"},"schema_version":"1.0","source":{"id":"2607.28104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28104","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28104v1","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28104","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"A22T55SB3YUD","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_16","alias_value":"A22T55SB3YUDUBDW","created_at":"2026-07-31T01:35:46Z"},{"alias_kind":"pith_short_8","alias_value":"A22T55SB","created_at":"2026-07-31T01:35:46Z"}],"graph_snapshots":[{"event_id":"sha256:bafe5b34dc212ae1c75b9d470d00a51e0eaec74e50f12d569c844aeeaff1a829","target":"graph","created_at":"2026-07-31T01:35:46Z","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/2607.28104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work presents a new adaptive finite-element framework for level-set transport, achieving high accuracy in kinematic interface transport problems relevant to interface-capturing methods for two-phase flows while reducing computational cost. This framework accommodates dynamic refinement and coarsening, and is compatible with standard finite-element data structures. The algorithm is applicable to both structured and unstructured discretizations in two and three dimensions. The method uses a tree-based hierarchical mesh with dynamic local refinement that tracks the evolving interface, concen","authors_text":"Andrea Chierici, Eugenio Aulisa, Giacomo Barbi, Samuele Baldini, Sandro Manservisi","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-30T12:12:42Z","title":"An Adaptive Finite Element Method for Marker-Driven Level-Set Transport on Hierarchical Meshes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28104","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:19dc06fcd5f480b4eafa5165dbc0f9f9fa20b9a047da19c509a5e9a8d23c8197","target":"record","created_at":"2026-07-31T01:35:46Z","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":"bbc044c8c29a7eeac08cb628695f5774d43d8795e73fbe235604d7c63370e606","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-30T12:12:42Z","title_canon_sha256":"072c196ed1ec3b0dcc51b35711de8cc5eca9d4974c863c3aeca51fb430597639"},"schema_version":"1.0","source":{"id":"2607.28104","kind":"arxiv","version":1}},"canonical_sha256":"06b53ef641de283a0476070dbe75fca71b076b0d8817430d361746e3e3208ebc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06b53ef641de283a0476070dbe75fca71b076b0d8817430d361746e3e3208ebc","first_computed_at":"2026-07-31T01:35:46.422578Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:35:46.422578Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19dc06fcd5f480b4eafa5165dbc0f9f9fa20b9a047da19c509a5e9a8d23c8197","sha256:bafe5b34dc212ae1c75b9d470d00a51e0eaec74e50f12d569c844aeeaff1a829","sha256:8facd92e4eaa216771f44d69f50390f75fa8dec26d0589d2c753899a76b9b14f"],"state_sha256":"73ebc329b66151b8fa7da6af108a3d71a92120c73ea0cdc36bcce66144dbc9f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMK0tjuWHKorHemT/mqwDJ/PcLvnwm3FGaib+qcX0nT2j/diF5mUn0J2fWdbxA6Aj4EMUZxJjC0EE4OiqppvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T06:50:10.010920Z","bundle_sha256":"034b37ef8a68310d12f8f411dccfded59fbc42d9e839488728a1b6aeb3ff5f13"}}