{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EPYOKGLNJTMXAKDNVSZIPEGRTM","short_pith_number":"pith:EPYOKGLN","schema_version":"1.0","canonical_sha256":"23f0e5196d4cd970286dacb28790d19b1b3eca57766c74c56e5e08900089197c","source":{"kind":"arxiv","id":"2106.01098","version":3},"attestation_state":"computed","paper":{"title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bastian Rieck, Karsten Borgwardt, Leslie O'Bray, Max Horn","submitted_at":"2021-06-02T12:04:29Z","abstract_excerpt":"Graph generative models are a highly active branch of machine learning. Given the steady development of new models of ever-increasing complexity, it is necessary to provide a principled way to evaluate and compare them. In this paper, we enumerate the desirable criteria for such a comparison metric and provide an overview of the status quo of graph generative model comparison in use today, which predominantly relies on the maximum mean discrepancy (MMD). We perform a systematic evaluation of MMD in the context of graph generative model comparison, highlighting some of the challenges and pitfal"},"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":"2106.01098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-02T12:04:29Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"678044529e43234a95b88d3d8e7b7e23e0bb8761251b6736fce05a671291aca8","abstract_canon_sha256":"c187d183c8fe88dcdbc458fd36fd963464bdaa5e16820273ceaf7c2984f14c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:15.115527Z","signature_b64":"h+CMHNHo84LV6+aDE13DnqPVqSAtW8CZldDizb3V717jmVZdDCO1SYSJsdrsxNCZPPn0HT6j4Vv6+XNcuZ43BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f0e5196d4cd970286dacb28790d19b1b3eca57766c74c56e5e08900089197c","last_reissued_at":"2026-07-05T04:06:15.114975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:15.114975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bastian Rieck, Karsten Borgwardt, Leslie O'Bray, Max Horn","submitted_at":"2021-06-02T12:04:29Z","abstract_excerpt":"Graph generative models are a highly active branch of machine learning. Given the steady development of new models of ever-increasing complexity, it is necessary to provide a principled way to evaluate and compare them. In this paper, we enumerate the desirable criteria for such a comparison metric and provide an overview of the status quo of graph generative model comparison in use today, which predominantly relies on the maximum mean discrepancy (MMD). We perform a systematic evaluation of MMD in the context of graph generative model comparison, highlighting some of the challenges and pitfal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01098","kind":"arxiv","version":3},"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/2106.01098/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":"2106.01098","created_at":"2026-07-05T04:06:15.115033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01098v3","created_at":"2026-07-05T04:06:15.115033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01098","created_at":"2026-07-05T04:06:15.115033+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPYOKGLNJTMX","created_at":"2026-07-05T04:06:15.115033+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPYOKGLNJTMXAKDN","created_at":"2026-07-05T04:06:15.115033+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPYOKGLN","created_at":"2026-07-05T04:06:15.115033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15839","citing_title":"Controllable Hand Grasp Generation for HOI and Efficient Evaluation Methods","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM","json":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM.json","graph_json":"https://pith.science/api/pith-number/EPYOKGLNJTMXAKDNVSZIPEGRTM/graph.json","events_json":"https://pith.science/api/pith-number/EPYOKGLNJTMXAKDNVSZIPEGRTM/events.json","paper":"https://pith.science/paper/EPYOKGLN"},"agent_actions":{"view_html":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM","download_json":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM.json","view_paper":"https://pith.science/paper/EPYOKGLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01098&json=true","fetch_graph":"https://pith.science/api/pith-number/EPYOKGLNJTMXAKDNVSZIPEGRTM/graph.json","fetch_events":"https://pith.science/api/pith-number/EPYOKGLNJTMXAKDNVSZIPEGRTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM/action/storage_attestation","attest_author":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM/action/author_attestation","sign_citation":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM/action/citation_signature","submit_replication":"https://pith.science/pith/EPYOKGLNJTMXAKDNVSZIPEGRTM/action/replication_record"}},"created_at":"2026-07-05T04:06:15.115033+00:00","updated_at":"2026-07-05T04:06:15.115033+00:00"}