{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WKRJRVOKXLAVSWQPL4PYBY4KOH","short_pith_number":"pith:WKRJRVOK","canonical_record":{"source":{"id":"1809.01369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-05T07:56:11Z","cross_cats_sorted":["cs.PF","cs.SI","stat.ML"],"title_canon_sha256":"6168fbcfa01b3ae278f9e7e22da94ddbd9946c7fb2559f0d229857071f95c327","abstract_canon_sha256":"4e65710234c93ad50567da6647fe6f6f3b9b527e4752bc8ffa5e358451cc2b8b"},"schema_version":"1.0"},"canonical_sha256":"b2a298d5cabac1595a0f5f1f80e38a71dfaa367e51077d812c17a3cd95d66980","source":{"kind":"arxiv","id":"1809.01369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01369","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01369v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01369","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"WKRJRVOKXLAV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WKRJRVOKXLAVSWQP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WKRJRVOK","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WKRJRVOKXLAVSWQPL4PYBY4KOH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-05T07:56:11Z","cross_cats_sorted":["cs.PF","cs.SI","stat.ML"],"title_canon_sha256":"6168fbcfa01b3ae278f9e7e22da94ddbd9946c7fb2559f0d229857071f95c327","abstract_canon_sha256":"4e65710234c93ad50567da6647fe6f6f3b9b527e4752bc8ffa5e358451cc2b8b"},"schema_version":"1.0"},"canonical_sha256":"b2a298d5cabac1595a0f5f1f80e38a71dfaa367e51077d812c17a3cd95d66980","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:27.842122Z","signature_b64":"/g+Jls5CLd1zhj2kB4XDXwUE5WTIWrivkw5gX2wqdq77dphkqWZry70Q4F3we5WG2B4ugzqqOUkR4Gh6L02KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a298d5cabac1595a0f5f1f80e38a71dfaa367e51077d812c17a3cd95d66980","last_reissued_at":"2026-05-18T00:06:27.841600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:27.841600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01369","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-18T00:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukP77W21yBuSRUA/K0Fcgpj3RnLTKh0DnEMoPTXSiIulHEMuoUM0WIo6gowkxv2qzu32SPSV9U3DWmP85lyiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:12:28.869845Z"},"content_sha256":"179628bdc8deceafdfbfd53a4f90b7f6716befceed0d408804aabc8ae4ea4eca","schema_version":"1.0","event_id":"sha256:179628bdc8deceafdfbfd53a4f90b7f6716befceed0d408804aabc8ae4ea4eca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WKRJRVOKXLAVSWQPL4PYBY4KOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards quantitative methods to assess network generative models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Sadegh Aliakbary, Vahid Mostofi","submitted_at":"2018-09-05T07:56:11Z","abstract_excerpt":"Assessing generative models is not an easy task. Generative models should synthesize graphs which are not replicates of real networks but show topological features similar to real graphs. We introduce an approach for assessing graph generative models using graph classifiers. The inability of an established graph classifier for distinguishing real and synthesized graphs could be considered as a performance measurement for graph generators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01369","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-18T00:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELuoRszRbXtZo7tBWtGWfNRMfjRRLAt4yCg7tR9kNuKAh7Gg0hV4sAtCd2RwNpW3cp0frOiwkmkAQ9DJesvbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:12:28.870190Z"},"content_sha256":"c15c3438d9fe7d0557f741db0755821717cb9150dbc0d7504d71991fafd27193","schema_version":"1.0","event_id":"sha256:c15c3438d9fe7d0557f741db0755821717cb9150dbc0d7504d71991fafd27193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/bundle.json","state_url":"https://pith.science/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/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-06-26T20:12:28Z","links":{"resolver":"https://pith.science/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH","bundle":"https://pith.science/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/bundle.json","state":"https://pith.science/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKRJRVOKXLAVSWQPL4PYBY4KOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WKRJRVOKXLAVSWQPL4PYBY4KOH","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":"4e65710234c93ad50567da6647fe6f6f3b9b527e4752bc8ffa5e358451cc2b8b","cross_cats_sorted":["cs.PF","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-05T07:56:11Z","title_canon_sha256":"6168fbcfa01b3ae278f9e7e22da94ddbd9946c7fb2559f0d229857071f95c327"},"schema_version":"1.0","source":{"id":"1809.01369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01369","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01369v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01369","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"WKRJRVOKXLAV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WKRJRVOKXLAVSWQP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WKRJRVOK","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:c15c3438d9fe7d0557f741db0755821717cb9150dbc0d7504d71991fafd27193","target":"graph","created_at":"2026-05-18T00:06:27Z","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":"Assessing generative models is not an easy task. Generative models should synthesize graphs which are not replicates of real networks but show topological features similar to real graphs. We introduce an approach for assessing graph generative models using graph classifiers. The inability of an established graph classifier for distinguishing real and synthesized graphs could be considered as a performance measurement for graph generators.","authors_text":"Sadegh Aliakbary, Vahid Mostofi","cross_cats":["cs.PF","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-05T07:56:11Z","title":"Towards quantitative methods to assess network generative models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01369","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:179628bdc8deceafdfbfd53a4f90b7f6716befceed0d408804aabc8ae4ea4eca","target":"record","created_at":"2026-05-18T00:06:27Z","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":"4e65710234c93ad50567da6647fe6f6f3b9b527e4752bc8ffa5e358451cc2b8b","cross_cats_sorted":["cs.PF","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-05T07:56:11Z","title_canon_sha256":"6168fbcfa01b3ae278f9e7e22da94ddbd9946c7fb2559f0d229857071f95c327"},"schema_version":"1.0","source":{"id":"1809.01369","kind":"arxiv","version":1}},"canonical_sha256":"b2a298d5cabac1595a0f5f1f80e38a71dfaa367e51077d812c17a3cd95d66980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2a298d5cabac1595a0f5f1f80e38a71dfaa367e51077d812c17a3cd95d66980","first_computed_at":"2026-05-18T00:06:27.841600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:27.841600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/g+Jls5CLd1zhj2kB4XDXwUE5WTIWrivkw5gX2wqdq77dphkqWZry70Q4F3we5WG2B4ugzqqOUkR4Gh6L02KBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:27.842122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:179628bdc8deceafdfbfd53a4f90b7f6716befceed0d408804aabc8ae4ea4eca","sha256:c15c3438d9fe7d0557f741db0755821717cb9150dbc0d7504d71991fafd27193"],"state_sha256":"00b695457f9476fa8e910e480b061bbbaabf6d5179ef96687ea40db0ff067122"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7zgrdnqIFCkS5DFxdrV6fYq7n50NUdbZQJyJHFBjQlYwovm7xfaPnUVKnXgWptTQ6lUlLkoLdvnL8opeBtgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:12:28.977058Z","bundle_sha256":"4157efa48dd5ec3c3577e3ed3cbe2f80a932db2a8ade756848bb098400f024dd"}}