{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QNKMVQAEHXPUP6NSVGF46C3E2J","short_pith_number":"pith:QNKMVQAE","schema_version":"1.0","canonical_sha256":"8354cac0043ddf47f9b2a98bcf0b64d2603d4c7800a639e642f531ffa235ae03","source":{"kind":"arxiv","id":"2308.06379","version":2},"attestation_state":"computed","paper":{"title":"Fast and effortless computation of profile likelihoods using CONNECT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","hep-ph"],"primary_cat":"astro-ph.CO","authors_text":"Andreas Nygaard, Emil Brinch Holm, Steen Hannestad, Thomas Tram","submitted_at":"2023-08-11T20:34:05Z","abstract_excerpt":"The frequentist method of profile likelihoods has recently received renewed attention in the field of cosmology. This is because the results of inferences based on the latter may differ from those of Bayesian inferences, either because of prior choices or because of non-Gaussianity in the likelihood function. Consequently, both methods are required for a fully nuanced analysis. However, in the last decades, cosmological parameter estimation has largely been dominated by Bayesian statistics due to the numerical complexity of constructing profile likelihoods, arising mainly from the need for a l"},"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":"2308.06379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2023-08-11T20:34:05Z","cross_cats_sorted":["astro-ph.IM","hep-ph"],"title_canon_sha256":"2d3b55b292661d59fa7d9267e570507f1639e46585895d56f9d2bcce0710df56","abstract_canon_sha256":"4a2d64dd27910e8cb67263daa5b662c598e093379cb156ffbfc4600e380a232c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:59.561556Z","signature_b64":"uC2r3XVdvhR3C1tYWynu8Xm3D+hsXRDPhZc3jVDpOvfELgh/Y8hF1Yi0ueZMoZC5D1JWa5kHXI2GutbirRzCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8354cac0043ddf47f9b2a98bcf0b64d2603d4c7800a639e642f531ffa235ae03","last_reissued_at":"2026-07-05T07:23:59.561041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:59.561041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and effortless computation of profile likelihoods using CONNECT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","hep-ph"],"primary_cat":"astro-ph.CO","authors_text":"Andreas Nygaard, Emil Brinch Holm, Steen Hannestad, Thomas Tram","submitted_at":"2023-08-11T20:34:05Z","abstract_excerpt":"The frequentist method of profile likelihoods has recently received renewed attention in the field of cosmology. This is because the results of inferences based on the latter may differ from those of Bayesian inferences, either because of prior choices or because of non-Gaussianity in the likelihood function. Consequently, both methods are required for a fully nuanced analysis. However, in the last decades, cosmological parameter estimation has largely been dominated by Bayesian statistics due to the numerical complexity of constructing profile likelihoods, arising mainly from the need for a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.06379/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":"2308.06379","created_at":"2026-07-05T07:23:59.561100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.06379v2","created_at":"2026-07-05T07:23:59.561100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06379","created_at":"2026-07-05T07:23:59.561100+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNKMVQAEHXPU","created_at":"2026-07-05T07:23:59.561100+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNKMVQAEHXPUP6NS","created_at":"2026-07-05T07:23:59.561100+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNKMVQAE","created_at":"2026-07-05T07:23:59.561100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02498","citing_title":"Alleviating prior dependencies for DESI DR1 clustering fits through reparameterization","ref_index":132,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J","json":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J.json","graph_json":"https://pith.science/api/pith-number/QNKMVQAEHXPUP6NSVGF46C3E2J/graph.json","events_json":"https://pith.science/api/pith-number/QNKMVQAEHXPUP6NSVGF46C3E2J/events.json","paper":"https://pith.science/paper/QNKMVQAE"},"agent_actions":{"view_html":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J","download_json":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J.json","view_paper":"https://pith.science/paper/QNKMVQAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.06379&json=true","fetch_graph":"https://pith.science/api/pith-number/QNKMVQAEHXPUP6NSVGF46C3E2J/graph.json","fetch_events":"https://pith.science/api/pith-number/QNKMVQAEHXPUP6NSVGF46C3E2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J/action/storage_attestation","attest_author":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J/action/author_attestation","sign_citation":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J/action/citation_signature","submit_replication":"https://pith.science/pith/QNKMVQAEHXPUP6NSVGF46C3E2J/action/replication_record"}},"created_at":"2026-07-05T07:23:59.561100+00:00","updated_at":"2026-07-05T07:23:59.561100+00:00"}