{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CTG4ZU5CLV6BEBV2LRE4X4H3KY","short_pith_number":"pith:CTG4ZU5C","canonical_record":{"source":{"id":"1905.13177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:03:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b02c098cfb72c39d8aff0c32eaa2c8f02037d8e5d9ffd66c7a60de60510f33fc","abstract_canon_sha256":"8a73acacebf83f7387793ecbf9cd4b240fb51b058f15959d3e92bdb05bb293d6"},"schema_version":"1.0"},"canonical_sha256":"14cdccd3a25d7c1206ba5c49cbf0fb5620a141ddfdf0a626cb21385ad5144ce0","source":{"kind":"arxiv","id":"1905.13177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13177","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13177v1","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13177","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"CTG4ZU5CLV6B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTG4ZU5CLV6BEBV2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTG4ZU5C","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CTG4ZU5CLV6BEBV2LRE4X4H3KY","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:03:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b02c098cfb72c39d8aff0c32eaa2c8f02037d8e5d9ffd66c7a60de60510f33fc","abstract_canon_sha256":"8a73acacebf83f7387793ecbf9cd4b240fb51b058f15959d3e92bdb05bb293d6"},"schema_version":"1.0"},"canonical_sha256":"14cdccd3a25d7c1206ba5c49cbf0fb5620a141ddfdf0a626cb21385ad5144ce0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.741312Z","signature_b64":"hvUywVS9PTmltwlr9U5yhNzSyUmr6+WZkJkDxrwz43LkNCR/c7IptzN5YvIvvD8acdHbFSyPiNQSL8225KMgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14cdccd3a25d7c1206ba5c49cbf0fb5620a141ddfdf0a626cb21385ad5144ce0","last_reissued_at":"2026-05-17T23:44:38.740694Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.740694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13177","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYsEMzY6mflEvBsXep+nrPJ+lGJvSU4KN2LWjJQGHMuBYBqQmdt5RSLx3w3d/VjJsM0myOmgv6ySbW46NnCyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:39:35.810430Z"},"content_sha256":"54fba39a7ec8f701a5130f5ed8c168c95d484aa0e8e72287b46a26422b252556","schema_version":"1.0","event_id":"sha256:54fba39a7ec8f701a5130f5ed8c168c95d484aa0e8e72287b46a26422b252556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CTG4ZU5CLV6BEBV2LRE4X4H3KY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Normalizing Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aviral Kumar, Jamie Kiros, Jenny Liu, Jimmy Ba, Kevin Swersky","submitted_at":"2019-05-30T17:03:41Z","abstract_excerpt":"We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs. In the unsupervised case, we combine graph normalizing flows with a novel graph auto-encoder to create a generative model of graph structures. Our model is permutation-invariant, generating entire graphs with a single feed-forward pass, and achieves competitive results with the state-of-the art a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13177","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8LyQ3UJsISPQlmIym2LMmEzaV+6uut8NKbGRKmTpyw1YNhGP7fxBgsvYYM4IhzrJsINaDdiTqUzKADfdkRrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:39:35.810781Z"},"content_sha256":"8003bb6bc7326b7fdc5e9957c211683d14e4c1e40c0541dc0be959de1f12eb28","schema_version":"1.0","event_id":"sha256:8003bb6bc7326b7fdc5e9957c211683d14e4c1e40c0541dc0be959de1f12eb28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/bundle.json","state_url":"https://pith.science/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T11:39:35Z","links":{"resolver":"https://pith.science/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY","bundle":"https://pith.science/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/bundle.json","state":"https://pith.science/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTG4ZU5CLV6BEBV2LRE4X4H3KY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CTG4ZU5CLV6BEBV2LRE4X4H3KY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8a73acacebf83f7387793ecbf9cd4b240fb51b058f15959d3e92bdb05bb293d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:03:41Z","title_canon_sha256":"b02c098cfb72c39d8aff0c32eaa2c8f02037d8e5d9ffd66c7a60de60510f33fc"},"schema_version":"1.0","source":{"id":"1905.13177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13177","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13177v1","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13177","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"CTG4ZU5CLV6B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTG4ZU5CLV6BEBV2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTG4ZU5C","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:8003bb6bc7326b7fdc5e9957c211683d14e4c1e40c0541dc0be959de1f12eb28","target":"graph","created_at":"2026-05-17T23:44:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs. In the unsupervised case, we combine graph normalizing flows with a novel graph auto-encoder to create a generative model of graph structures. Our model is permutation-invariant, generating entire graphs with a single feed-forward pass, and achieves competitive results with the state-of-the art a","authors_text":"Aviral Kumar, Jamie Kiros, Jenny Liu, Jimmy Ba, Kevin Swersky","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:03:41Z","title":"Graph Normalizing Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13177","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:54fba39a7ec8f701a5130f5ed8c168c95d484aa0e8e72287b46a26422b252556","target":"record","created_at":"2026-05-17T23:44:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8a73acacebf83f7387793ecbf9cd4b240fb51b058f15959d3e92bdb05bb293d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T17:03:41Z","title_canon_sha256":"b02c098cfb72c39d8aff0c32eaa2c8f02037d8e5d9ffd66c7a60de60510f33fc"},"schema_version":"1.0","source":{"id":"1905.13177","kind":"arxiv","version":1}},"canonical_sha256":"14cdccd3a25d7c1206ba5c49cbf0fb5620a141ddfdf0a626cb21385ad5144ce0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14cdccd3a25d7c1206ba5c49cbf0fb5620a141ddfdf0a626cb21385ad5144ce0","first_computed_at":"2026-05-17T23:44:38.740694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:38.740694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvUywVS9PTmltwlr9U5yhNzSyUmr6+WZkJkDxrwz43LkNCR/c7IptzN5YvIvvD8acdHbFSyPiNQSL8225KMgAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:38.741312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54fba39a7ec8f701a5130f5ed8c168c95d484aa0e8e72287b46a26422b252556","sha256:8003bb6bc7326b7fdc5e9957c211683d14e4c1e40c0541dc0be959de1f12eb28"],"state_sha256":"369bb16701acfa04e417c6bc010c2767b90d3696ef2b4d75d6178bf1b3c1078f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egurqebWU/873AShXehX+dDABpu+RZnvZ9M3RI6On0qYLp947Zbi+9WvQahic8adFTy2uWDDGUlZFqyRXt8cBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:39:35.812677Z","bundle_sha256":"1787aed117c55726c867f6758035820f98dad6b6a653774cb880008e6fc928c3"}}