{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NUFDPKFBVGFTWJ5ZRJXUZ3CRPT","short_pith_number":"pith:NUFDPKFB","schema_version":"1.0","canonical_sha256":"6d0a37a8a1a98b3b27b98a6f4cec517cca6c6c8d8db31575dc8c4fb267e60880","source":{"kind":"arxiv","id":"2412.15582","version":1},"attestation_state":"computed","paper":{"title":"A Deep Probabilistic Framework for Continuous Time Dynamic Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Filippo Simini, Henry Hoffmann, Ryien Hosseini, Venkatram Vishwanath","submitted_at":"2024-12-20T05:34:11Z","abstract_excerpt":"Recent advancements in graph representation learning have shifted attention towards dynamic graphs, which exhibit evolving topologies and features over time. The increased use of such graphs creates a paramount need for generative models suitable for applications such as data augmentation, obfuscation, and anomaly detection. However, there are few generative techniques that handle continuously changing temporal graph data; existing work largely relies on augmenting static graphs with additional temporal information to model dynamic interactions between nodes. In this work, we propose a fundame"},"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":"2412.15582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T05:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"608d40ccde8b6e038bedf94be293b9827248a46ba2dbfead7f0743b34f533fb1","abstract_canon_sha256":"e135b987c1cf7a8d650eccd86412e4e8ea667bdbc588dcd085edb3a2c2e36853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:25.983062Z","signature_b64":"qRC2t96gT3ebkiRq43s/qFmfNRrwf6XARTu6Y/u+l0OZ6oy6wWKd2StxuEeKkYfojB6UH2hwH2OSzJvBqPDMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0a37a8a1a98b3b27b98a6f4cec517cca6c6c8d8db31575dc8c4fb267e60880","last_reissued_at":"2026-07-05T09:52:25.981790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:25.981790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deep Probabilistic Framework for Continuous Time Dynamic Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Filippo Simini, Henry Hoffmann, Ryien Hosseini, Venkatram Vishwanath","submitted_at":"2024-12-20T05:34:11Z","abstract_excerpt":"Recent advancements in graph representation learning have shifted attention towards dynamic graphs, which exhibit evolving topologies and features over time. The increased use of such graphs creates a paramount need for generative models suitable for applications such as data augmentation, obfuscation, and anomaly detection. However, there are few generative techniques that handle continuously changing temporal graph data; existing work largely relies on augmenting static graphs with additional temporal information to model dynamic interactions between nodes. In this work, we propose a fundame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15582","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/2412.15582/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":"2412.15582","created_at":"2026-07-05T09:52:25.982513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15582v1","created_at":"2026-07-05T09:52:25.982513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15582","created_at":"2026-07-05T09:52:25.982513+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUFDPKFBVGFT","created_at":"2026-07-05T09:52:25.982513+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUFDPKFBVGFTWJ5Z","created_at":"2026-07-05T09:52:25.982513+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUFDPKFB","created_at":"2026-07-05T09:52:25.982513+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/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT","json":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT.json","graph_json":"https://pith.science/api/pith-number/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/graph.json","events_json":"https://pith.science/api/pith-number/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/events.json","paper":"https://pith.science/paper/NUFDPKFB"},"agent_actions":{"view_html":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT","download_json":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT.json","view_paper":"https://pith.science/paper/NUFDPKFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15582&json=true","fetch_graph":"https://pith.science/api/pith-number/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/graph.json","fetch_events":"https://pith.science/api/pith-number/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/action/storage_attestation","attest_author":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/action/author_attestation","sign_citation":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/action/citation_signature","submit_replication":"https://pith.science/pith/NUFDPKFBVGFTWJ5ZRJXUZ3CRPT/action/replication_record"}},"created_at":"2026-07-05T09:52:25.982513+00:00","updated_at":"2026-07-05T09:52:25.982513+00:00"}