{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6UNJKT47VAA2CQXBMDDY7YWBLP","short_pith_number":"pith:6UNJKT47","schema_version":"1.0","canonical_sha256":"f51a954f9fa801a142e160c78fe2c15bc95cf892a2dcf0101f6599528b5209bc","source":{"kind":"arxiv","id":"2503.11643","version":2},"attestation_state":"computed","paper":{"title":"From few to many maps: A fast map-level emulator for extreme augmentation of CMB systematics datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","physics.data-an"],"primary_cat":"astro-ph.CO","authors_text":"E. Allys, J.-M. Delouis, L. Pagano, M. Gerbino, M. Lattanzi, P. Campeti","submitted_at":"2025-03-14T17:58:07Z","abstract_excerpt":"We introduce a novel, fast, and efficient generative model built upon scattering covariances, the most recent iteration of the scattering transforms statistics. This model is designed to augment by several orders of magnitude the number of map simulations in datasets of computationally expensive CMB instrumental systematics simulations, including their non-Gaussian and inhomogeneous features. Unlike conventional neural network-based algorithms, this generative model requires only a minimal number of training samples, making it highly compatible with the computational constraints of typical CMB"},"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":"2503.11643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2025-03-14T17:58:07Z","cross_cats_sorted":["astro-ph.IM","physics.data-an"],"title_canon_sha256":"e060eb21785277e2de900a5309a7dfbdf63f2b3c0b5eb44f2ae8e54f78329170","abstract_canon_sha256":"0e814a2cfb322c0812a987e8ee839d85994a007c9dc025c3e06477c030f7f4a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:47.216075Z","signature_b64":"2406fRtBCzEr7LaAczBArO3YRPfgJbviXxc9CgLS0SMEdrQrrFdii0QnkGQAi220Dq8KpKmLmYgstPqhhoA/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f51a954f9fa801a142e160c78fe2c15bc95cf892a2dcf0101f6599528b5209bc","last_reissued_at":"2026-07-05T11:52:47.215564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:47.215564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From few to many maps: A fast map-level emulator for extreme augmentation of CMB systematics datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","physics.data-an"],"primary_cat":"astro-ph.CO","authors_text":"E. Allys, J.-M. Delouis, L. Pagano, M. Gerbino, M. Lattanzi, P. Campeti","submitted_at":"2025-03-14T17:58:07Z","abstract_excerpt":"We introduce a novel, fast, and efficient generative model built upon scattering covariances, the most recent iteration of the scattering transforms statistics. This model is designed to augment by several orders of magnitude the number of map simulations in datasets of computationally expensive CMB instrumental systematics simulations, including their non-Gaussian and inhomogeneous features. Unlike conventional neural network-based algorithms, this generative model requires only a minimal number of training samples, making it highly compatible with the computational constraints of typical CMB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11643","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/2503.11643/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":"2503.11643","created_at":"2026-07-05T11:52:47.215624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11643v2","created_at":"2026-07-05T11:52:47.215624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11643","created_at":"2026-07-05T11:52:47.215624+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UNJKT47VAA2","created_at":"2026-07-05T11:52:47.215624+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UNJKT47VAA2CQXB","created_at":"2026-07-05T11:52:47.215624+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UNJKT47","created_at":"2026-07-05T11:52:47.215624+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07257","citing_title":"Open Source Planning & Control System with Language Agents for Autonomous Scientific Discovery","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP","json":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP.json","graph_json":"https://pith.science/api/pith-number/6UNJKT47VAA2CQXBMDDY7YWBLP/graph.json","events_json":"https://pith.science/api/pith-number/6UNJKT47VAA2CQXBMDDY7YWBLP/events.json","paper":"https://pith.science/paper/6UNJKT47"},"agent_actions":{"view_html":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP","download_json":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP.json","view_paper":"https://pith.science/paper/6UNJKT47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11643&json=true","fetch_graph":"https://pith.science/api/pith-number/6UNJKT47VAA2CQXBMDDY7YWBLP/graph.json","fetch_events":"https://pith.science/api/pith-number/6UNJKT47VAA2CQXBMDDY7YWBLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP/action/storage_attestation","attest_author":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP/action/author_attestation","sign_citation":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP/action/citation_signature","submit_replication":"https://pith.science/pith/6UNJKT47VAA2CQXBMDDY7YWBLP/action/replication_record"}},"created_at":"2026-07-05T11:52:47.215624+00:00","updated_at":"2026-07-05T11:52:47.215624+00:00"}