{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G4OH4ZSO6347H3AWU7V6CYC5BH","short_pith_number":"pith:G4OH4ZSO","schema_version":"1.0","canonical_sha256":"371c7e664ef6f9f3ec16a7ebe1605d09cd0402e7e1906bf84b2ab92ee433239e","source":{"kind":"arxiv","id":"2505.02589","version":1},"attestation_state":"computed","paper":{"title":"DeepHMC : a deep-neural-network acclerated Hamiltonian Monte Carlo algorithm for binary neutron star parameter estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"gr-qc","authors_text":"Edward K. Porter, Jules Perret, Marc Ar\\'ene","submitted_at":"2025-05-05T11:54:14Z","abstract_excerpt":"We present a deep neural network (DNN) accelerated Hamiltonian Monte Carlo (HMC) algorithm called DeepHMC for the inference of binary neutron star systems. The HMC is a non-random walk sampler that uses background gradient information to accelerate the convergence of the sampler. While faster converging than a random-walk sampler, in theory by a factor of the dimensionality of the problem, a known computational bottleneck for HMC algorithms is the calculation of gradients of the log-likelihood. We demonstrate that Hamiltonian trajectories based on a DNN gradients are 30 times faster than those"},"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":"2505.02589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"gr-qc","submitted_at":"2025-05-05T11:54:14Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"2a31ad89b7524741e5691fa043a14ea35c4069f8590917a3f41045f624cadd43","abstract_canon_sha256":"d1e5da97ca8a1bb777f7842b5f2688c91ae7a4b84dcf3731a4229abeece2bbcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:40.009078Z","signature_b64":"E7eAmV1EbIni0d9tyb3E0QjYIb/hShgRswDTqCcmIGyQKD8w5B2P2nfutCUGbR9TG0meizVq82cQTED11JEZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371c7e664ef6f9f3ec16a7ebe1605d09cd0402e7e1906bf84b2ab92ee433239e","last_reissued_at":"2026-07-05T10:58:40.008640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:40.008640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepHMC : a deep-neural-network acclerated Hamiltonian Monte Carlo algorithm for binary neutron star parameter estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"gr-qc","authors_text":"Edward K. Porter, Jules Perret, Marc Ar\\'ene","submitted_at":"2025-05-05T11:54:14Z","abstract_excerpt":"We present a deep neural network (DNN) accelerated Hamiltonian Monte Carlo (HMC) algorithm called DeepHMC for the inference of binary neutron star systems. The HMC is a non-random walk sampler that uses background gradient information to accelerate the convergence of the sampler. While faster converging than a random-walk sampler, in theory by a factor of the dimensionality of the problem, a known computational bottleneck for HMC algorithms is the calculation of gradients of the log-likelihood. We demonstrate that Hamiltonian trajectories based on a DNN gradients are 30 times faster than those"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02589","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/2505.02589/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":"2505.02589","created_at":"2026-07-05T10:58:40.008696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02589v1","created_at":"2026-07-05T10:58:40.008696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02589","created_at":"2026-07-05T10:58:40.008696+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4OH4ZSO6347","created_at":"2026-07-05T10:58:40.008696+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4OH4ZSO6347H3AW","created_at":"2026-07-05T10:58:40.008696+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4OH4ZSO","created_at":"2026-07-05T10:58:40.008696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21530","citing_title":"Detectability and Parameter Estimation for Einstein Telescope Configurations with GWJulia","ref_index":94,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH","json":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH.json","graph_json":"https://pith.science/api/pith-number/G4OH4ZSO6347H3AWU7V6CYC5BH/graph.json","events_json":"https://pith.science/api/pith-number/G4OH4ZSO6347H3AWU7V6CYC5BH/events.json","paper":"https://pith.science/paper/G4OH4ZSO"},"agent_actions":{"view_html":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH","download_json":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH.json","view_paper":"https://pith.science/paper/G4OH4ZSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02589&json=true","fetch_graph":"https://pith.science/api/pith-number/G4OH4ZSO6347H3AWU7V6CYC5BH/graph.json","fetch_events":"https://pith.science/api/pith-number/G4OH4ZSO6347H3AWU7V6CYC5BH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH/action/storage_attestation","attest_author":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH/action/author_attestation","sign_citation":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH/action/citation_signature","submit_replication":"https://pith.science/pith/G4OH4ZSO6347H3AWU7V6CYC5BH/action/replication_record"}},"created_at":"2026-07-05T10:58:40.008696+00:00","updated_at":"2026-07-05T10:58:40.008696+00:00"}