{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q7J6NP6GODNXNTW5N3MFWIGJ7R","short_pith_number":"pith:Q7J6NP6G","schema_version":"1.0","canonical_sha256":"87d3e6bfc670db76cedd6ed85b20c9fc50fc57f6ceb81b3593b07d2d90631f96","source":{"kind":"arxiv","id":"1810.11080","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Sweep-based Solver for the $S_{N}$ Equations on High-Order Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"B. S. Southworth, P. G. Maginot, T. A. Brunner, T. S. Bailey, T. S. Haut, V. Z. Tomov","submitted_at":"2018-10-25T19:34:27Z","abstract_excerpt":"We propose a graph-based sweep algorithm for solving the steady state, mono-energetic discrete ordinates on meshes of high-order curved mesh elements. Our spatial discretization consists of arbitrarily high-order discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements, and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights."},"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":"1810.11080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-25T19:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"6d8f93a662aca2ac115f01a5ca0937c0ff980266e086ad537abee8f541eb4930","abstract_canon_sha256":"6a380d0797d0ed87b23a0d05b79c9bc183ccc69016acb6a110d8bf1aae9192da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:36.367647Z","signature_b64":"DUr9sHcB9OocpMlxkxiwoxFwk7xa5Lajplbj2S4a6H0gM3oiA92SX4YVJtYD+DW+ItJfsJJYW6ilBJi2yADMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d3e6bfc670db76cedd6ed85b20c9fc50fc57f6ceb81b3593b07d2d90631f96","last_reissued_at":"2026-05-17T23:56:36.366926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:36.366926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Sweep-based Solver for the $S_{N}$ Equations on High-Order Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"B. S. Southworth, P. G. Maginot, T. A. Brunner, T. S. Bailey, T. S. Haut, V. Z. Tomov","submitted_at":"2018-10-25T19:34:27Z","abstract_excerpt":"We propose a graph-based sweep algorithm for solving the steady state, mono-energetic discrete ordinates on meshes of high-order curved mesh elements. Our spatial discretization consists of arbitrarily high-order discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements, and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11080","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":"1810.11080","created_at":"2026-05-17T23:56:36.367039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11080v2","created_at":"2026-05-17T23:56:36.367039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11080","created_at":"2026-05-17T23:56:36.367039+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7J6NP6GODNX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7J6NP6GODNXNTW5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7J6NP6G","created_at":"2026-05-18T12:32:46.962924+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/Q7J6NP6GODNXNTW5N3MFWIGJ7R","json":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R.json","graph_json":"https://pith.science/api/pith-number/Q7J6NP6GODNXNTW5N3MFWIGJ7R/graph.json","events_json":"https://pith.science/api/pith-number/Q7J6NP6GODNXNTW5N3MFWIGJ7R/events.json","paper":"https://pith.science/paper/Q7J6NP6G"},"agent_actions":{"view_html":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R","download_json":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R.json","view_paper":"https://pith.science/paper/Q7J6NP6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11080&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7J6NP6GODNXNTW5N3MFWIGJ7R/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7J6NP6GODNXNTW5N3MFWIGJ7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R/action/storage_attestation","attest_author":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R/action/author_attestation","sign_citation":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R/action/citation_signature","submit_replication":"https://pith.science/pith/Q7J6NP6GODNXNTW5N3MFWIGJ7R/action/replication_record"}},"created_at":"2026-05-17T23:56:36.367039+00:00","updated_at":"2026-05-17T23:56:36.367039+00:00"}