{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:64YDUWJXIIA3OD2S7E6RR45LIH","short_pith_number":"pith:64YDUWJX","schema_version":"1.0","canonical_sha256":"f7303a59374201b70f52f93d18f3ab41fdb4997e62368f3c7698a13e58696e8b","source":{"kind":"arxiv","id":"1909.13521","version":1},"attestation_state":"computed","paper":{"title":"Graph Residual Flow for Molecular Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hirotaka Akita, Katsuhiko Ishiguro, Kenta Oono, Shion Honda, Toshiki Nakanishi","submitted_at":"2019-09-30T08:43:10Z","abstract_excerpt":"Statistical generative models for molecular graphs attract attention from many researchers from the fields of bio- and chemo-informatics. Among these models, invertible flow-based approaches are not fully explored yet. In this paper, we propose a powerful invertible flow for molecular graphs, called graph residual flow (GRF). The GRF is based on residual flows, which are known for more flexible and complex non-linear mappings than traditional coupling flows. We theoretically derive non-trivial conditions such that GRF is invertible, and present a way of keeping the entire flows invertible thro"},"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":"1909.13521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-30T08:43:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d09b5bce8a8d98a40c5751d65de40340e63a5ee6f66ed7e67de6dda610f451bd","abstract_canon_sha256":"f369af2543c056aabf5ce3a64f6e187aa2086b14a9edb7ca266a8b5704ba392c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:08:11.041186Z","signature_b64":"UVN2HKFp75O0muulfXfpRRIH6ue9ws5Lb8Tcyl1FZ4sjv/Jrjg0+hRPuq3IXbexWx2tSHwqIKZoCWDwD2ACsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7303a59374201b70f52f93d18f3ab41fdb4997e62368f3c7698a13e58696e8b","last_reissued_at":"2026-07-05T00:08:11.040786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:08:11.040786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Residual Flow for Molecular Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hirotaka Akita, Katsuhiko Ishiguro, Kenta Oono, Shion Honda, Toshiki Nakanishi","submitted_at":"2019-09-30T08:43:10Z","abstract_excerpt":"Statistical generative models for molecular graphs attract attention from many researchers from the fields of bio- and chemo-informatics. Among these models, invertible flow-based approaches are not fully explored yet. In this paper, we propose a powerful invertible flow for molecular graphs, called graph residual flow (GRF). The GRF is based on residual flows, which are known for more flexible and complex non-linear mappings than traditional coupling flows. We theoretically derive non-trivial conditions such that GRF is invertible, and present a way of keeping the entire flows invertible thro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13521","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/1909.13521/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":"1909.13521","created_at":"2026-07-05T00:08:11.040846+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.13521v1","created_at":"2026-07-05T00:08:11.040846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13521","created_at":"2026-07-05T00:08:11.040846+00:00"},{"alias_kind":"pith_short_12","alias_value":"64YDUWJXIIA3","created_at":"2026-07-05T00:08:11.040846+00:00"},{"alias_kind":"pith_short_16","alias_value":"64YDUWJXIIA3OD2S","created_at":"2026-07-05T00:08:11.040846+00:00"},{"alias_kind":"pith_short_8","alias_value":"64YDUWJX","created_at":"2026-07-05T00:08:11.040846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19089","citing_title":"Fine-Grained Traffic Inference from Road to Lane via Spatio-Temporal Graph Node Generation","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH","json":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH.json","graph_json":"https://pith.science/api/pith-number/64YDUWJXIIA3OD2S7E6RR45LIH/graph.json","events_json":"https://pith.science/api/pith-number/64YDUWJXIIA3OD2S7E6RR45LIH/events.json","paper":"https://pith.science/paper/64YDUWJX"},"agent_actions":{"view_html":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH","download_json":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH.json","view_paper":"https://pith.science/paper/64YDUWJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.13521&json=true","fetch_graph":"https://pith.science/api/pith-number/64YDUWJXIIA3OD2S7E6RR45LIH/graph.json","fetch_events":"https://pith.science/api/pith-number/64YDUWJXIIA3OD2S7E6RR45LIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH/action/storage_attestation","attest_author":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH/action/author_attestation","sign_citation":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH/action/citation_signature","submit_replication":"https://pith.science/pith/64YDUWJXIIA3OD2S7E6RR45LIH/action/replication_record"}},"created_at":"2026-07-05T00:08:11.040846+00:00","updated_at":"2026-07-05T00:08:11.040846+00:00"}