{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5CLRLO4PO2NHCFKTA6MYN7FQIN","short_pith_number":"pith:5CLRLO4P","schema_version":"1.0","canonical_sha256":"e89715bb8f769a711553079986fcb043462274c8d3198e89fcd4866a458f0c20","source":{"kind":"arxiv","id":"1908.02436","version":2},"attestation_state":"computed","paper":{"title":"Continuous Graph Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Greg Mori, Lili Meng, Megha Nawhal, Zhiwei Deng","submitted_at":"2019-08-07T04:24:48Z","abstract_excerpt":"In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a probability density over the random variables represented by the graph. It is formulated as an ordinary differential equation system with shared and reusable functions that operate over the graphs. This leads to a new type of neural graph message passing scheme that performs continuous message passing over time. This class of models offers several advantages: a flexi"},"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":"1908.02436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-07T04:24:48Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"072dfab6c695db45e9f8fe0ff1e8cada71fd6606569489db243a24c5853da88e","abstract_canon_sha256":"fcb2ed38e76e4ed08e541f5d98f0ae885faff6c37ab31463a781bfa8d2582c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:52.682290Z","signature_b64":"8HEfHe2oXXgq2AmyaTSACsK9YLAO1jij+z7GblHNljoQUslxaBiP8i0J17ReJEKIBngKKyG1iSZteX/tPyWZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89715bb8f769a711553079986fcb043462274c8d3198e89fcd4866a458f0c20","last_reissued_at":"2026-07-05T00:07:52.681876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:52.681876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Graph Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Greg Mori, Lili Meng, Megha Nawhal, Zhiwei Deng","submitted_at":"2019-08-07T04:24:48Z","abstract_excerpt":"In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a probability density over the random variables represented by the graph. It is formulated as an ordinary differential equation system with shared and reusable functions that operate over the graphs. This leads to a new type of neural graph message passing scheme that performs continuous message passing over time. This class of models offers several advantages: a flexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02436","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/1908.02436/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":"1908.02436","created_at":"2026-07-05T00:07:52.681931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02436v2","created_at":"2026-07-05T00:07:52.681931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02436","created_at":"2026-07-05T00:07:52.681931+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CLRLO4PO2NH","created_at":"2026-07-05T00:07:52.681931+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CLRLO4PO2NHCFKT","created_at":"2026-07-05T00:07:52.681931+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CLRLO4P","created_at":"2026-07-05T00:07:52.681931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19138","citing_title":"INDEQS: Informed Neural controlled Differential EQuationS","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN","json":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN.json","graph_json":"https://pith.science/api/pith-number/5CLRLO4PO2NHCFKTA6MYN7FQIN/graph.json","events_json":"https://pith.science/api/pith-number/5CLRLO4PO2NHCFKTA6MYN7FQIN/events.json","paper":"https://pith.science/paper/5CLRLO4P"},"agent_actions":{"view_html":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN","download_json":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN.json","view_paper":"https://pith.science/paper/5CLRLO4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02436&json=true","fetch_graph":"https://pith.science/api/pith-number/5CLRLO4PO2NHCFKTA6MYN7FQIN/graph.json","fetch_events":"https://pith.science/api/pith-number/5CLRLO4PO2NHCFKTA6MYN7FQIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN/action/storage_attestation","attest_author":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN/action/author_attestation","sign_citation":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN/action/citation_signature","submit_replication":"https://pith.science/pith/5CLRLO4PO2NHCFKTA6MYN7FQIN/action/replication_record"}},"created_at":"2026-07-05T00:07:52.681931+00:00","updated_at":"2026-07-05T00:07:52.681931+00:00"}