{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KKS3LVQHDT2E65OMRMJTF6U4ZU","short_pith_number":"pith:KKS3LVQH","schema_version":"1.0","canonical_sha256":"52a5b5d6071cf44f75cc8b1332fa9ccd36ddf71315ee18c8dd7ff1db2a32ffd8","source":{"kind":"arxiv","id":"1805.11973","version":2},"attestation_state":"computed","paper":{"title":"MolGAN: An implicit generative model for small molecular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nicola De Cao, Thomas Kipf","submitted_at":"2018-05-30T13:56:06Z","abstract_excerpt":"Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive search procedures in the discrete and vast space of chemical structures. We introduce MolGAN, an implicit, likelihood-free generative model for small molecular graphs that circumvents the need for expensive graph matching procedures or node ordering heuristics of previous likelihood-based methods. Our method adapts generative adversarial networks (GANs) to operate directly on g"},"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":"1805.11973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-30T13:56:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"40ff8ea833ca03a86b6e189ddce8e59be0d3beea0b70f0b3391a6f7e5715edd2","abstract_canon_sha256":"33cd83a3fbd6f5de2e8b7eb8d60a3f1eb991eae1398f6c310208633b02eb5ac6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:57.488984Z","signature_b64":"ok2TjMSfVp/YLddqJlJaGwXWqsobu9vB/toqrJnJIXgnOOpccQOn9sT5Ic3XQk8GeiubYnS+efc6YySfdaQhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a5b5d6071cf44f75cc8b1332fa9ccd36ddf71315ee18c8dd7ff1db2a32ffd8","last_reissued_at":"2026-07-05T05:00:57.488506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:57.488506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MolGAN: An implicit generative model for small molecular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nicola De Cao, Thomas Kipf","submitted_at":"2018-05-30T13:56:06Z","abstract_excerpt":"Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive search procedures in the discrete and vast space of chemical structures. We introduce MolGAN, an implicit, likelihood-free generative model for small molecular graphs that circumvents the need for expensive graph matching procedures or node ordering heuristics of previous likelihood-based methods. Our method adapts generative adversarial networks (GANs) to operate directly on g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11973","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/1805.11973/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":"1805.11973","created_at":"2026-07-05T05:00:57.488569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11973v2","created_at":"2026-07-05T05:00:57.488569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11973","created_at":"2026-07-05T05:00:57.488569+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKS3LVQHDT2E","created_at":"2026-07-05T05:00:57.488569+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKS3LVQHDT2E65OM","created_at":"2026-07-05T05:00:57.488569+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKS3LVQH","created_at":"2026-07-05T05:00:57.488569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":17,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08854","citing_title":"sGPO: Trading Inference FLOPs for Training Efficiency in RLVR","ref_index":193,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01061","citing_title":"Agentic generation of verifiable rules for deterministic, self-expanding reaction classification","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22377","citing_title":"Multigrid Training for Molecular Generation using Graph Neural Networks","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"1907.05315","citing_title":"Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"1907.08990","citing_title":"Spectral-based Graph Convolutional Network for Directed Graphs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2409.02231","citing_title":"SmileyLlama: Modifying Large Language Models for Directed Chemical Space Exploration","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2409.09183","citing_title":"Quantum-inspired Reinforcement Learning for Synthesizable Drug Design","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2506.06226","citing_title":"No Data? No Problem: Synthesizing Security Graphs for Better Intrusion Detection","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2509.17291","citing_title":"GraphWeave: Interpretable and Robust Graph Generation via Random Walk Trajectories","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2509.21838","citing_title":"Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2510.20792","citing_title":"BadGraph: A Backdoor Attack Against Latent Diffusion Model for Text-Guided Graph Generation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2511.03015","citing_title":"Discrete Bayesian Sample Inference for Graph Generation","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2512.05844","citing_title":"NEAT: Neighborhood-Guided, Efficient, Autoregressive Set Transformer for 3D Molecular Generation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09065","citing_title":"Dependency-Aware Discrete Diffusion for Scene Graph Generation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06303","citing_title":"Molecules Meet Language: Confound-Aware Representation Learning and Chemical Property Steering in Transformer-VAE Latent Spaces","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18031","citing_title":"How Creative Are Large Language Models in Generating Molecules?","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13877","citing_title":"Scalable Quantum Molecular Generation via GPU-Accelerated Tensor-Network Simulation","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU","json":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU.json","graph_json":"https://pith.science/api/pith-number/KKS3LVQHDT2E65OMRMJTF6U4ZU/graph.json","events_json":"https://pith.science/api/pith-number/KKS3LVQHDT2E65OMRMJTF6U4ZU/events.json","paper":"https://pith.science/paper/KKS3LVQH"},"agent_actions":{"view_html":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU","download_json":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU.json","view_paper":"https://pith.science/paper/KKS3LVQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11973&json=true","fetch_graph":"https://pith.science/api/pith-number/KKS3LVQHDT2E65OMRMJTF6U4ZU/graph.json","fetch_events":"https://pith.science/api/pith-number/KKS3LVQHDT2E65OMRMJTF6U4ZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU/action/storage_attestation","attest_author":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU/action/author_attestation","sign_citation":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU/action/citation_signature","submit_replication":"https://pith.science/pith/KKS3LVQHDT2E65OMRMJTF6U4ZU/action/replication_record"}},"created_at":"2026-07-05T05:00:57.488569+00:00","updated_at":"2026-07-05T05:00:57.488569+00:00"}