{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U3L4NVNZLRRVXXSCOXZMUWBS3D","short_pith_number":"pith:U3L4NVNZ","schema_version":"1.0","canonical_sha256":"a6d7c6d5b95c635bde4275f2ca5832d8c078a650721fbfd73e9eeadcb00ec05d","source":{"kind":"arxiv","id":"2201.09871","version":2},"attestation_state":"computed","paper":{"title":"On Evaluation Metrics for Graph Generative Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boris Knyazev, Elahe Ghalebi, Graham W. Taylor, Jungtaek Kim, Rylee Thompson","submitted_at":"2022-01-24T18:49:27Z","abstract_excerpt":"In image generation, generative models can be evaluated naturally by visually inspecting model outputs. However, this is not always the case for graph generative models (GGMs), making their evaluation challenging. Currently, the standard process for evaluating GGMs suffers from three critical limitations: i) it does not produce a single score which makes model selection challenging, ii) in many cases it fails to consider underlying edge and node features, and iii) it is prohibitively slow to perform. In this work, we mitigate these issues by searching for scalar, domain-agnostic, and scalable "},"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":"2201.09871","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T18:49:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"55dcfe3ea79788b521e6218e6b4147c24d8f2f54f6c404b4590c85aacf845e58","abstract_canon_sha256":"1c10adff1560098e3b117ec7d2748a8b335c18eff7bae06a72cfbb73b75a7e02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:29.913897Z","signature_b64":"mePoJy2ATBes+QLR9oeNWJ1ys+4W2sxlAdyTbxrHTn29C6jlWIgW3GXtsTyMdXwvzic2+rtE4ku9G9jnJgqgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d7c6d5b95c635bde4275f2ca5832d8c078a650721fbfd73e9eeadcb00ec05d","last_reissued_at":"2026-07-05T04:18:29.913422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:29.913422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Evaluation Metrics for Graph Generative Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boris Knyazev, Elahe Ghalebi, Graham W. Taylor, Jungtaek Kim, Rylee Thompson","submitted_at":"2022-01-24T18:49:27Z","abstract_excerpt":"In image generation, generative models can be evaluated naturally by visually inspecting model outputs. However, this is not always the case for graph generative models (GGMs), making their evaluation challenging. Currently, the standard process for evaluating GGMs suffers from three critical limitations: i) it does not produce a single score which makes model selection challenging, ii) in many cases it fails to consider underlying edge and node features, and iii) it is prohibitively slow to perform. In this work, we mitigate these issues by searching for scalar, domain-agnostic, and scalable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09871","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/2201.09871/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":"2201.09871","created_at":"2026-07-05T04:18:29.913474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.09871v2","created_at":"2026-07-05T04:18:29.913474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09871","created_at":"2026-07-05T04:18:29.913474+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3L4NVNZLRRV","created_at":"2026-07-05T04:18:29.913474+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3L4NVNZLRRVXXSC","created_at":"2026-07-05T04:18:29.913474+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3L4NVNZ","created_at":"2026-07-05T04:18:29.913474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.06226","citing_title":"No Data? No Problem: Synthesizing Security Graphs for Better Intrusion Detection","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24811","citing_title":"Time-varying Interaction Graph ODE for Dynamic Graph Representation Learning","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D","json":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D.json","graph_json":"https://pith.science/api/pith-number/U3L4NVNZLRRVXXSCOXZMUWBS3D/graph.json","events_json":"https://pith.science/api/pith-number/U3L4NVNZLRRVXXSCOXZMUWBS3D/events.json","paper":"https://pith.science/paper/U3L4NVNZ"},"agent_actions":{"view_html":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D","download_json":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D.json","view_paper":"https://pith.science/paper/U3L4NVNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.09871&json=true","fetch_graph":"https://pith.science/api/pith-number/U3L4NVNZLRRVXXSCOXZMUWBS3D/graph.json","fetch_events":"https://pith.science/api/pith-number/U3L4NVNZLRRVXXSCOXZMUWBS3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D/action/storage_attestation","attest_author":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D/action/author_attestation","sign_citation":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D/action/citation_signature","submit_replication":"https://pith.science/pith/U3L4NVNZLRRVXXSCOXZMUWBS3D/action/replication_record"}},"created_at":"2026-07-05T04:18:29.913474+00:00","updated_at":"2026-07-05T04:18:29.913474+00:00"}