{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SC254PLVOEIWTUNGM6OJ6K7B6E","short_pith_number":"pith:SC254PLV","schema_version":"1.0","canonical_sha256":"90b5de3d75711169d1a6679c9f2be1f12923a888b7c17625bd1b4b25b429bebd","source":{"kind":"arxiv","id":"1907.01572","version":1},"attestation_state":"computed","paper":{"title":"A hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","gr-qc","math.NA"],"primary_cat":"physics.comp-ph","authors_text":"Harald P. Pfeiffer, Nils L. Fischer, Trevor Vincent","submitted_at":"2019-07-02T18:14:13Z","abstract_excerpt":"A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The"},"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":"1907.01572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2019-07-02T18:14:13Z","cross_cats_sorted":["cs.NA","gr-qc","math.NA"],"title_canon_sha256":"6b9d310a6666848895b502d8a5cc1f27cc2da59e183a7e6704c670e0cfa86235","abstract_canon_sha256":"3255350a0564cea1faa4353e1de35073b0b75ac8a9a4b3b2ef2184cb2df72fdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:38.377487Z","signature_b64":"Scfu3nCHUSRaicwYNbrcD3JqSa+2jq9up39VlRe0KwFv0AsvPH/TmzEJ93CE1BaQxQZUUOOprcog9qd9pQ21CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b5de3d75711169d1a6679c9f2be1f12923a888b7c17625bd1b4b25b429bebd","last_reissued_at":"2026-07-05T00:15:38.377003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:38.377003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","gr-qc","math.NA"],"primary_cat":"physics.comp-ph","authors_text":"Harald P. Pfeiffer, Nils L. Fischer, Trevor Vincent","submitted_at":"2019-07-02T18:14:13Z","abstract_excerpt":"A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01572","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/1907.01572/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.01572","created_at":"2026-07-05T00:15:38.377061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01572v1","created_at":"2026-07-05T00:15:38.377061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01572","created_at":"2026-07-05T00:15:38.377061+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC254PLVOEIW","created_at":"2026-07-05T00:15:38.377061+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC254PLVOEIWTUNG","created_at":"2026-07-05T00:15:38.377061+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC254PLV","created_at":"2026-07-05T00:15:38.377061+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07653","citing_title":"Celephais: efficient spectral initial data code for precessing compact binaries","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E","json":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E.json","graph_json":"https://pith.science/api/pith-number/SC254PLVOEIWTUNGM6OJ6K7B6E/graph.json","events_json":"https://pith.science/api/pith-number/SC254PLVOEIWTUNGM6OJ6K7B6E/events.json","paper":"https://pith.science/paper/SC254PLV"},"agent_actions":{"view_html":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E","download_json":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E.json","view_paper":"https://pith.science/paper/SC254PLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01572&json=true","fetch_graph":"https://pith.science/api/pith-number/SC254PLVOEIWTUNGM6OJ6K7B6E/graph.json","fetch_events":"https://pith.science/api/pith-number/SC254PLVOEIWTUNGM6OJ6K7B6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E/action/storage_attestation","attest_author":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E/action/author_attestation","sign_citation":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E/action/citation_signature","submit_replication":"https://pith.science/pith/SC254PLVOEIWTUNGM6OJ6K7B6E/action/replication_record"}},"created_at":"2026-07-05T00:15:38.377061+00:00","updated_at":"2026-07-05T00:15:38.377061+00:00"}