{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PRAJVNX53S3L4GHMSNTNXVW6AC","short_pith_number":"pith:PRAJVNX5","schema_version":"1.0","canonical_sha256":"7c409ab6fddcb6be18ec9366dbd6de00bbeb09982da407dd6d6522eea056c03f","source":{"kind":"arxiv","id":"1602.03641","version":2},"attestation_state":"computed","paper":{"title":"Parallel Vertex Approximate Gradient discretization of hybrid dimensional Darcy flow and transport in discrete fracture networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.NA","math.AP"],"primary_cat":"math.NA","authors_text":"BRGM), Coffee, COFFEE), Feng Xing (JAD, Roland Masson (JAD, Simon Lopez (BRGM)","submitted_at":"2016-02-11T08:26:07Z","abstract_excerpt":"This paper proposes a parallel numerical algorithm to simulate the flow and the transport in a discrete fracture network taking into account the mass exchanges with the surrounding matrix. The discretization of the Darcy fluxes is based on the Vertex Approximate Gradient finite volume scheme adapted to polyhedral meshes and to heterogeneous anisotropic media, and the transport equation is discretized by a first order upwind scheme combined with an Euler explicit integration in time. The parallelization is based on the SPMD (Single Program, Multiple Data) paradigm and relies on a distribution o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.03641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-11T08:26:07Z","cross_cats_sorted":["cs.CE","cs.NA","math.AP"],"title_canon_sha256":"1286533fd9ca15d30873fd7ce89fcbfc2508833f943d7d3230e9b490cc340444","abstract_canon_sha256":"3748f7e351fd08b7fa2a30f215f8b65b5b84509d5ea93397c1b23585eb441bfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.260587Z","signature_b64":"bFIImUanlK95Qm/4XWLT45O+tkYwBJ3ovmSkuLvrrqpJFNwUmTK+u3hj5qfoFjYV6iUX0ynzccawMDDkOl0fCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c409ab6fddcb6be18ec9366dbd6de00bbeb09982da407dd6d6522eea056c03f","last_reissued_at":"2026-05-18T00:58:04.260154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.260154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Vertex Approximate Gradient discretization of hybrid dimensional Darcy flow and transport in discrete fracture networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.NA","math.AP"],"primary_cat":"math.NA","authors_text":"BRGM), Coffee, COFFEE), Feng Xing (JAD, Roland Masson (JAD, Simon Lopez (BRGM)","submitted_at":"2016-02-11T08:26:07Z","abstract_excerpt":"This paper proposes a parallel numerical algorithm to simulate the flow and the transport in a discrete fracture network taking into account the mass exchanges with the surrounding matrix. The discretization of the Darcy fluxes is based on the Vertex Approximate Gradient finite volume scheme adapted to polyhedral meshes and to heterogeneous anisotropic media, and the transport equation is discretized by a first order upwind scheme combined with an Euler explicit integration in time. The parallelization is based on the SPMD (Single Program, Multiple Data) paradigm and relies on a distribution o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03641","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.03641","created_at":"2026-05-18T00:58:04.260214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03641v2","created_at":"2026-05-18T00:58:04.260214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03641","created_at":"2026-05-18T00:58:04.260214+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRAJVNX53S3L","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRAJVNX53S3L4GHM","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRAJVNX5","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC","json":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC.json","graph_json":"https://pith.science/api/pith-number/PRAJVNX53S3L4GHMSNTNXVW6AC/graph.json","events_json":"https://pith.science/api/pith-number/PRAJVNX53S3L4GHMSNTNXVW6AC/events.json","paper":"https://pith.science/paper/PRAJVNX5"},"agent_actions":{"view_html":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC","download_json":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC.json","view_paper":"https://pith.science/paper/PRAJVNX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03641&json=true","fetch_graph":"https://pith.science/api/pith-number/PRAJVNX53S3L4GHMSNTNXVW6AC/graph.json","fetch_events":"https://pith.science/api/pith-number/PRAJVNX53S3L4GHMSNTNXVW6AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC/action/storage_attestation","attest_author":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC/action/author_attestation","sign_citation":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC/action/citation_signature","submit_replication":"https://pith.science/pith/PRAJVNX53S3L4GHMSNTNXVW6AC/action/replication_record"}},"created_at":"2026-05-18T00:58:04.260214+00:00","updated_at":"2026-05-18T00:58:04.260214+00:00"}