{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A3Q34HKLMGYJKCF6EMCFGDAQK2","short_pith_number":"pith:A3Q34HKL","schema_version":"1.0","canonical_sha256":"06e1be1d4b61b09508be2304530c1056af8f2e4c79eba8f72edb0bbcb4f679d7","source":{"kind":"arxiv","id":"2405.15059","version":2},"attestation_state":"computed","paper":{"title":"Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christiane Lemieux, Daniela Rus, Michael M. Bronstein, Nathan Kirk, T. Konstantin Rusch","submitted_at":"2024-05-23T21:17:20Z","abstract_excerpt":"Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy points play a central role in many problems in science and engineering, including numerical integration, computer vision, machine perception, computer graphics, machine learning, and simulation. In this work, we present the first machine learning approach to generate a new class of low-discrepancy point sets named Message-Passing Monte Carlo (MPMC) points. Motiva"},"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":"2405.15059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T21:17:20Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"2c6fe975270e506d78a586837de73a9af557a43caa7a9e5c2bd5db5e5333f0fa","abstract_canon_sha256":"aeed90930a7b123b2575da601256507f2f302edf2df73dddac63ef2dbdcf7345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:06.484459Z","signature_b64":"7zkrvKituw+rZ8DXXUU1yEqQTH01VK1YESDWp+tr9kJ59MBlLgmlVhXM7Cf5iH5EJZwMQQonsW/6832yFjkyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e1be1d4b61b09508be2304530c1056af8f2e4c79eba8f72edb0bbcb4f679d7","last_reissued_at":"2026-07-05T09:12:06.483962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:06.483962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christiane Lemieux, Daniela Rus, Michael M. Bronstein, Nathan Kirk, T. Konstantin Rusch","submitted_at":"2024-05-23T21:17:20Z","abstract_excerpt":"Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy points play a central role in many problems in science and engineering, including numerical integration, computer vision, machine perception, computer graphics, machine learning, and simulation. In this work, we present the first machine learning approach to generate a new class of low-discrepancy point sets named Message-Passing Monte Carlo (MPMC) points. Motiva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15059","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/2405.15059/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":"2405.15059","created_at":"2026-07-05T09:12:06.484020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.15059v2","created_at":"2026-07-05T09:12:06.484020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15059","created_at":"2026-07-05T09:12:06.484020+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3Q34HKLMGYJ","created_at":"2026-07-05T09:12:06.484020+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3Q34HKLMGYJKCF6","created_at":"2026-07-05T09:12:06.484020+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3Q34HKL","created_at":"2026-07-05T09:12:06.484020+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/A3Q34HKLMGYJKCF6EMCFGDAQK2","json":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2.json","graph_json":"https://pith.science/api/pith-number/A3Q34HKLMGYJKCF6EMCFGDAQK2/graph.json","events_json":"https://pith.science/api/pith-number/A3Q34HKLMGYJKCF6EMCFGDAQK2/events.json","paper":"https://pith.science/paper/A3Q34HKL"},"agent_actions":{"view_html":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2","download_json":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2.json","view_paper":"https://pith.science/paper/A3Q34HKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.15059&json=true","fetch_graph":"https://pith.science/api/pith-number/A3Q34HKLMGYJKCF6EMCFGDAQK2/graph.json","fetch_events":"https://pith.science/api/pith-number/A3Q34HKLMGYJKCF6EMCFGDAQK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2/action/storage_attestation","attest_author":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2/action/author_attestation","sign_citation":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2/action/citation_signature","submit_replication":"https://pith.science/pith/A3Q34HKLMGYJKCF6EMCFGDAQK2/action/replication_record"}},"created_at":"2026-07-05T09:12:06.484020+00:00","updated_at":"2026-07-05T09:12:06.484020+00:00"}