{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PXIN7O3K6X2TFMFU7P6A5JGEYA","short_pith_number":"pith:PXIN7O3K","canonical_record":{"source":{"id":"2210.16844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-30T13:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"e31233205cab751afecff8cbdee0a03e9f9b94c2a31364c60978f21fb2ecdfc1","abstract_canon_sha256":"37367abf3ea936ed50c76ea3b4c1c06e50f21b3e047b6e42bb1b09e7dbf278ed"},"schema_version":"1.0"},"canonical_sha256":"7dd0dfbb6af5f532b0b4fbfc0ea4c4c031e9f3604e725fd005e9b2eb00d417c3","source":{"kind":"arxiv","id":"2210.16844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.16844","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"arxiv_version","alias_value":"2210.16844v2","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.16844","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_12","alias_value":"PXIN7O3K6X2T","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"PXIN7O3K6X2TFMFU","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"PXIN7O3K","created_at":"2026-07-05T05:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PXIN7O3K6X2TFMFU7P6A5JGEYA","target":"record","payload":{"canonical_record":{"source":{"id":"2210.16844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-30T13:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"e31233205cab751afecff8cbdee0a03e9f9b94c2a31364c60978f21fb2ecdfc1","abstract_canon_sha256":"37367abf3ea936ed50c76ea3b4c1c06e50f21b3e047b6e42bb1b09e7dbf278ed"},"schema_version":"1.0"},"canonical_sha256":"7dd0dfbb6af5f532b0b4fbfc0ea4c4c031e9f3604e725fd005e9b2eb00d417c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:56.793999Z","signature_b64":"MNe3fSa3kvzG7+RMU98PsJ8QXjvuOaDcYz9f7nYwZGL2osHVmSkPEzFaanZkVIBhs0lhT+VGuvNxPcbrRoZmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dd0dfbb6af5f532b0b4fbfc0ea4c4c031e9f3604e725fd005e9b2eb00d417c3","last_reissued_at":"2026-07-05T05:32:56.793528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:56.793528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.16844","source_version":2,"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-07-05T05:32:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bm2UmhTBKn2r7WS4O6NJmWAbLdwvLFkyJE+9MAI6RdzEi8BGbEU9qR7NfPw89PmUG5qzItQW+BASryoxTmk2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:54:54.843515Z"},"content_sha256":"4f36459df185d2c3e030183d8a90babe33e24c5eb619ee20bf811f92670541ad","schema_version":"1.0","event_id":"sha256:4f36459df185d2c3e030183d8a90babe33e24c5eb619ee20bf811f92670541ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PXIN7O3K6X2TFMFU7P6A5JGEYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ke Li, Kiarash Zahirnia, Oliver Schulte, Parmis Naddaf","submitted_at":"2022-10-30T13:45:21Z","abstract_excerpt":"Generative models for graph data are an important research topic in machine learning. Graph data comprise two levels that are typically analyzed separately: node-level properties such as the existence of a link between a pair of nodes, and global aggregate graph-level statistics, such as motif counts. This paper proposes a new multi-level framework that jointly models node-level properties and graph-level statistics, as mutually reinforcing sources of information. We introduce a new micro-macro training objective for graph generation that combines node-level and graph-level losses. We utilize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.16844","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/2210.16844/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"},"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-07-05T05:32:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJO4MhHL2VGI21+k6PmHT2rWH9zYJs/XZa8YjPd1aIbSbPeZlmraFGTuSblYnGgw+rx1nPuW3a+QSHDTexLyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:54:54.844172Z"},"content_sha256":"8610cac47e81859b245a393c572dcb704dd9b3d91ad74c960b2f955633cb53cb","schema_version":"1.0","event_id":"sha256:8610cac47e81859b245a393c572dcb704dd9b3d91ad74c960b2f955633cb53cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/bundle.json","state_url":"https://pith.science/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/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-08-03T15:54:54Z","links":{"resolver":"https://pith.science/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA","bundle":"https://pith.science/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/bundle.json","state":"https://pith.science/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXIN7O3K6X2TFMFU7P6A5JGEYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PXIN7O3K6X2TFMFU7P6A5JGEYA","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":"37367abf3ea936ed50c76ea3b4c1c06e50f21b3e047b6e42bb1b09e7dbf278ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-30T13:45:21Z","title_canon_sha256":"e31233205cab751afecff8cbdee0a03e9f9b94c2a31364c60978f21fb2ecdfc1"},"schema_version":"1.0","source":{"id":"2210.16844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.16844","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"arxiv_version","alias_value":"2210.16844v2","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.16844","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_12","alias_value":"PXIN7O3K6X2T","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"PXIN7O3K6X2TFMFU","created_at":"2026-07-05T05:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"PXIN7O3K","created_at":"2026-07-05T05:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:8610cac47e81859b245a393c572dcb704dd9b3d91ad74c960b2f955633cb53cb","target":"graph","created_at":"2026-07-05T05:32:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.16844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generative models for graph data are an important research topic in machine learning. Graph data comprise two levels that are typically analyzed separately: node-level properties such as the existence of a link between a pair of nodes, and global aggregate graph-level statistics, such as motif counts. This paper proposes a new multi-level framework that jointly models node-level properties and graph-level statistics, as mutually reinforcing sources of information. We introduce a new micro-macro training objective for graph generation that combines node-level and graph-level losses. We utilize ","authors_text":"Ke Li, Kiarash Zahirnia, Oliver Schulte, Parmis Naddaf","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-30T13:45:21Z","title":"Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.16844","kind":"arxiv","version":2},"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:4f36459df185d2c3e030183d8a90babe33e24c5eb619ee20bf811f92670541ad","target":"record","created_at":"2026-07-05T05:32:56Z","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":"37367abf3ea936ed50c76ea3b4c1c06e50f21b3e047b6e42bb1b09e7dbf278ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-30T13:45:21Z","title_canon_sha256":"e31233205cab751afecff8cbdee0a03e9f9b94c2a31364c60978f21fb2ecdfc1"},"schema_version":"1.0","source":{"id":"2210.16844","kind":"arxiv","version":2}},"canonical_sha256":"7dd0dfbb6af5f532b0b4fbfc0ea4c4c031e9f3604e725fd005e9b2eb00d417c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dd0dfbb6af5f532b0b4fbfc0ea4c4c031e9f3604e725fd005e9b2eb00d417c3","first_computed_at":"2026-07-05T05:32:56.793528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:56.793528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNe3fSa3kvzG7+RMU98PsJ8QXjvuOaDcYz9f7nYwZGL2osHVmSkPEzFaanZkVIBhs0lhT+VGuvNxPcbrRoZmCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:56.793999Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.16844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f36459df185d2c3e030183d8a90babe33e24c5eb619ee20bf811f92670541ad","sha256:8610cac47e81859b245a393c572dcb704dd9b3d91ad74c960b2f955633cb53cb"],"state_sha256":"928d911fbda990fd740ed63b726964851f059a046f87190e039ae7f44cde5cd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWbMe5ayHgDrKyk+/BBdCZZ5D0FY8ysfZ0r5Otis7dCJot71lMaI7O0pULLXW6+nO2IY9wwBc/2GCQru+y2xDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:54:54.851014Z","bundle_sha256":"c44c8d7bedffe85e76ec5db1052cad419447f9359cce2da3f5183fff20557a70"}}