{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4PPOHL44E4LDOZW3WFSH3ADYVQ","short_pith_number":"pith:4PPOHL44","schema_version":"1.0","canonical_sha256":"e3dee3af9c27163766dbb1647d8078ac37b785d2208f6743fe1f6b4890546722","source":{"kind":"arxiv","id":"2607.19126","version":1},"attestation_state":"computed","paper":{"title":"Parallel Noising in Neural Markov Logic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Giuseppe Marra, Ondrej Kuzelka, Peter Jung","submitted_at":"2026-07-21T14:13:09Z","abstract_excerpt":"Neural Markov Logic Networks (NMLNs) are a flexible neurosymbolic relational model. Previous work has shown that, although NMLNs achieve strong performance as generative models for small relational structures, they underperform diffusion-based generative graph models on larger structures. In this paper, we strengthen NMLNs along two main dimensions: (i) we increase the expressive capacity of their potential functions using graph neural networks, and (ii) we develop a new training and inference algorithm inspired by parallel-tempering Markov chain Monte Carlo methods, which we name parallel noi"},"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":"2607.19126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-21T14:13:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7897101965bbeb7f5693585ef96407a31ecedc78f6769da4d5b2a6d2607805e8","abstract_canon_sha256":"860f84d7083c303569709f9a255f5d52f4a3d9a014b07d87d65f70a27e8bf3cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:24:09.931603Z","signature_b64":"o1xG34MtuAEc6QKxmsNqz/IJ4nbNFHPA7WuRivrz+wNOZQdgj7EtCqLUFd4foyzz4trSBthc0EQ1NJ9ew4HyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3dee3af9c27163766dbb1647d8078ac37b785d2208f6743fe1f6b4890546722","last_reissued_at":"2026-07-22T01:24:09.930692Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:24:09.930692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Noising in Neural Markov Logic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Giuseppe Marra, Ondrej Kuzelka, Peter Jung","submitted_at":"2026-07-21T14:13:09Z","abstract_excerpt":"Neural Markov Logic Networks (NMLNs) are a flexible neurosymbolic relational model. Previous work has shown that, although NMLNs achieve strong performance as generative models for small relational structures, they underperform diffusion-based generative graph models on larger structures. In this paper, we strengthen NMLNs along two main dimensions: (i) we increase the expressive capacity of their potential functions using graph neural networks, and (ii) we develop a new training and inference algorithm inspired by parallel-tempering Markov chain Monte Carlo methods, which we name parallel noi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19126","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/2607.19126/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":"2607.19126","created_at":"2026-07-22T01:24:09.931131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19126v1","created_at":"2026-07-22T01:24:09.931131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19126","created_at":"2026-07-22T01:24:09.931131+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PPOHL44E4LD","created_at":"2026-07-22T01:24:09.931131+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PPOHL44E4LDOZW3","created_at":"2026-07-22T01:24:09.931131+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PPOHL44","created_at":"2026-07-22T01:24:09.931131+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/4PPOHL44E4LDOZW3WFSH3ADYVQ","json":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ.json","graph_json":"https://pith.science/api/pith-number/4PPOHL44E4LDOZW3WFSH3ADYVQ/graph.json","events_json":"https://pith.science/api/pith-number/4PPOHL44E4LDOZW3WFSH3ADYVQ/events.json","paper":"https://pith.science/paper/4PPOHL44"},"agent_actions":{"view_html":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ","download_json":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ.json","view_paper":"https://pith.science/paper/4PPOHL44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19126&json=true","fetch_graph":"https://pith.science/api/pith-number/4PPOHL44E4LDOZW3WFSH3ADYVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4PPOHL44E4LDOZW3WFSH3ADYVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ/action/storage_attestation","attest_author":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ/action/author_attestation","sign_citation":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ/action/citation_signature","submit_replication":"https://pith.science/pith/4PPOHL44E4LDOZW3WFSH3ADYVQ/action/replication_record"}},"created_at":"2026-07-22T01:24:09.931131+00:00","updated_at":"2026-07-22T01:24:09.931131+00:00"}