{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H64564XXHYDQQJRY5J25RNOADN","short_pith_number":"pith:H64564XX","schema_version":"1.0","canonical_sha256":"3fb9df72f73e07082638ea75d8b5c01b671759cc72828e5b3ccf98f72571bb6f","source":{"kind":"arxiv","id":"1803.10207","version":1},"attestation_state":"computed","paper":{"title":"Numerical generation of vector potentials from specified magnetic fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","gr-qc"],"primary_cat":"physics.comp-ph","authors_text":"Ian Ruchlin, Joshua A. Faber, Thomas R. Adams, Zachariah B. Etienne, Zachary J. Silberman","submitted_at":"2018-03-27T17:45:35Z","abstract_excerpt":"Many codes have been developed to study highly relativistic, magnetized flows around and inside compact objects. Depending on the adopted formalism, some of these codes evolve the vector potential $\\mathbf{A}$, and others evolve the magnetic field $\\mathbf{B}=\\nabla\\times\\mathbf{A}$ directly. Given that these codes possess unique strengths, sometimes it is desirable to start a simulation using a code that evolves $\\mathbf{B}$ and complete it using a code that evolves $\\mathbf{A}$. Thus transferring the data from one code to another would require an inverse curl algorithm. This paper describes "},"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":"1803.10207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-03-27T17:45:35Z","cross_cats_sorted":["astro-ph.IM","gr-qc"],"title_canon_sha256":"dcf3f8107ae3bcdfff139fadda5f0b549cba861cd0536de84613c7148736e5c0","abstract_canon_sha256":"555223fd484d25c771060d28540478b3c30c4bed7fc176032c6ce34af0e6ca5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:21.080364Z","signature_b64":"77jK2sZKYgVEtgQCnOrGvt9EuNl/Dwr+QahPs9gfY4Ay+VhxRBAbfIBVeC4DgbD+BOhgwtJWL7mcfDE8yrzbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb9df72f73e07082638ea75d8b5c01b671759cc72828e5b3ccf98f72571bb6f","last_reissued_at":"2026-05-17T23:55:21.079939Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:21.079939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical generation of vector potentials from specified magnetic fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","gr-qc"],"primary_cat":"physics.comp-ph","authors_text":"Ian Ruchlin, Joshua A. Faber, Thomas R. Adams, Zachariah B. Etienne, Zachary J. Silberman","submitted_at":"2018-03-27T17:45:35Z","abstract_excerpt":"Many codes have been developed to study highly relativistic, magnetized flows around and inside compact objects. Depending on the adopted formalism, some of these codes evolve the vector potential $\\mathbf{A}$, and others evolve the magnetic field $\\mathbf{B}=\\nabla\\times\\mathbf{A}$ directly. Given that these codes possess unique strengths, sometimes it is desirable to start a simulation using a code that evolves $\\mathbf{B}$ and complete it using a code that evolves $\\mathbf{A}$. Thus transferring the data from one code to another would require an inverse curl algorithm. This paper describes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10207","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":""},"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":"1803.10207","created_at":"2026-05-17T23:55:21.080011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10207v1","created_at":"2026-05-17T23:55:21.080011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10207","created_at":"2026-05-17T23:55:21.080011+00:00"},{"alias_kind":"pith_short_12","alias_value":"H64564XXHYDQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H64564XXHYDQQJRY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H64564XX","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15912","citing_title":"BHaHAHA: A Fast, Robust Apparent Horizon Finder Library for Numerical Relativity","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN","json":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN.json","graph_json":"https://pith.science/api/pith-number/H64564XXHYDQQJRY5J25RNOADN/graph.json","events_json":"https://pith.science/api/pith-number/H64564XXHYDQQJRY5J25RNOADN/events.json","paper":"https://pith.science/paper/H64564XX"},"agent_actions":{"view_html":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN","download_json":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN.json","view_paper":"https://pith.science/paper/H64564XX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10207&json=true","fetch_graph":"https://pith.science/api/pith-number/H64564XXHYDQQJRY5J25RNOADN/graph.json","fetch_events":"https://pith.science/api/pith-number/H64564XXHYDQQJRY5J25RNOADN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN/action/storage_attestation","attest_author":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN/action/author_attestation","sign_citation":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN/action/citation_signature","submit_replication":"https://pith.science/pith/H64564XXHYDQQJRY5J25RNOADN/action/replication_record"}},"created_at":"2026-05-17T23:55:21.080011+00:00","updated_at":"2026-05-17T23:55:21.080011+00:00"}