{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ENN7ZRQPK6CMPOSEBEQP3WLI2B","short_pith_number":"pith:ENN7ZRQP","canonical_record":{"source":{"id":"2007.05970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T12:06:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4c753ca86900141d7cd93d4daa139db26c5482e8b625e255708159b54ab55bd6","abstract_canon_sha256":"3b8b4fe1ba61e7b26c8ab2d1d880a87252875496ae064ed6f63949b6736d3854"},"schema_version":"1.0"},"canonical_sha256":"235bfcc60f5784c7ba440920fdd968d06033e1699db2926439b7ac5d9d3fcc67","source":{"kind":"arxiv","id":"2007.05970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05970","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05970v1","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05970","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"ENN7ZRQPK6CM","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_16","alias_value":"ENN7ZRQPK6CMPOSE","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_8","alias_value":"ENN7ZRQP","created_at":"2026-07-05T01:18:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ENN7ZRQPK6CMPOSEBEQP3WLI2B","target":"record","payload":{"canonical_record":{"source":{"id":"2007.05970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T12:06:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4c753ca86900141d7cd93d4daa139db26c5482e8b625e255708159b54ab55bd6","abstract_canon_sha256":"3b8b4fe1ba61e7b26c8ab2d1d880a87252875496ae064ed6f63949b6736d3854"},"schema_version":"1.0"},"canonical_sha256":"235bfcc60f5784c7ba440920fdd968d06033e1699db2926439b7ac5d9d3fcc67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:18:08.696645Z","signature_b64":"HWojlNkzuzDtxS/TBZQTXaq3IzSd7OkY7yaLGRPxjqLwvr0lovYpHeEkm7Rblkq9PqFf4Y6BytTQxoYKsJX+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"235bfcc60f5784c7ba440920fdd968d06033e1699db2926439b7ac5d9d3fcc67","last_reissued_at":"2026-07-05T01:18:08.696239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:18:08.696239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.05970","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-07-05T01:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16Eu1HlnlVGANYNOveGiBE4bY5FXhceMdWYtKLEN0RlSgmMrcc068qj9Ua/hrgcVRaolKqYeY42YdrBkTMO2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:00:26.782170Z"},"content_sha256":"83bde615074c218f5168c6d14adac328b6f93a4ffb0737b43776fb0772c0b486","schema_version":"1.0","event_id":"sha256:83bde615074c218f5168c6d14adac328b6f93a4ffb0737b43776fb0772c0b486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ENN7ZRQPK6CMPOSEBEQP3WLI2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Peilin Zhao, Tian Bian, Tingyang Xu, Wenbing Huang, Xi Xiao, Yu Rong","submitted_at":"2020-07-12T12:06:17Z","abstract_excerpt":"Graph Identification (GI) has long been researched in graph learning and is essential in certain applications (e.g. social community detection). Specifically, GI requires to predict the label/score of a target graph given its collection of node features and edge connections. While this task is common, more complex cases arise in practice---we are supposed to do the inverse thing by, for example, grouping similar users in a social network given the labels of different communities. This triggers an interesting thought: can we identify nodes given the labels of the graphs they belong to? Therefor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05970","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.05970/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-05T01:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ej0BSUr54L1xCYdsh2HJrAvgp0/W5Ty44tgESzYXrl4HUGCf16wUtkgNvLQvXgoAWd6I4Wv8Qx6G01MCxzBbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:00:26.782568Z"},"content_sha256":"ab357f7d19f5ce362901a4bc073352318af7212eb883b204240e96694f089f6a","schema_version":"1.0","event_id":"sha256:ab357f7d19f5ce362901a4bc073352318af7212eb883b204240e96694f089f6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/bundle.json","state_url":"https://pith.science/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/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-07-12T08:00:26Z","links":{"resolver":"https://pith.science/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B","bundle":"https://pith.science/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/bundle.json","state":"https://pith.science/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENN7ZRQPK6CMPOSEBEQP3WLI2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ENN7ZRQPK6CMPOSEBEQP3WLI2B","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":"3b8b4fe1ba61e7b26c8ab2d1d880a87252875496ae064ed6f63949b6736d3854","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T12:06:17Z","title_canon_sha256":"4c753ca86900141d7cd93d4daa139db26c5482e8b625e255708159b54ab55bd6"},"schema_version":"1.0","source":{"id":"2007.05970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05970","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05970v1","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05970","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"ENN7ZRQPK6CM","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_16","alias_value":"ENN7ZRQPK6CMPOSE","created_at":"2026-07-05T01:18:08Z"},{"alias_kind":"pith_short_8","alias_value":"ENN7ZRQP","created_at":"2026-07-05T01:18:08Z"}],"graph_snapshots":[{"event_id":"sha256:ab357f7d19f5ce362901a4bc073352318af7212eb883b204240e96694f089f6a","target":"graph","created_at":"2026-07-05T01:18:08Z","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/2007.05970/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Identification (GI) has long been researched in graph learning and is essential in certain applications (e.g. social community detection). Specifically, GI requires to predict the label/score of a target graph given its collection of node features and edge connections. While this task is common, more complex cases arise in practice---we are supposed to do the inverse thing by, for example, grouping similar users in a social network given the labels of different communities. This triggers an interesting thought: can we identify nodes given the labels of the graphs they belong to? Therefor","authors_text":"Junzhou Huang, Peilin Zhao, Tian Bian, Tingyang Xu, Wenbing Huang, Xi Xiao, Yu Rong","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T12:06:17Z","title":"Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05970","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:83bde615074c218f5168c6d14adac328b6f93a4ffb0737b43776fb0772c0b486","target":"record","created_at":"2026-07-05T01:18:08Z","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":"3b8b4fe1ba61e7b26c8ab2d1d880a87252875496ae064ed6f63949b6736d3854","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T12:06:17Z","title_canon_sha256":"4c753ca86900141d7cd93d4daa139db26c5482e8b625e255708159b54ab55bd6"},"schema_version":"1.0","source":{"id":"2007.05970","kind":"arxiv","version":1}},"canonical_sha256":"235bfcc60f5784c7ba440920fdd968d06033e1699db2926439b7ac5d9d3fcc67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"235bfcc60f5784c7ba440920fdd968d06033e1699db2926439b7ac5d9d3fcc67","first_computed_at":"2026-07-05T01:18:08.696239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:18:08.696239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWojlNkzuzDtxS/TBZQTXaq3IzSd7OkY7yaLGRPxjqLwvr0lovYpHeEkm7Rblkq9PqFf4Y6BytTQxoYKsJX+DA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:18:08.696645Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.05970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83bde615074c218f5168c6d14adac328b6f93a4ffb0737b43776fb0772c0b486","sha256:ab357f7d19f5ce362901a4bc073352318af7212eb883b204240e96694f089f6a"],"state_sha256":"6ca4a9d36a83a4329813757c7b642ffabb955626c2d7fde5a321ab119900ee97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQBAl2KGEWmoyDtTBGV9FaiQhoEhQ64yz7B8Aq7AuqBG+ZAilnqJ96p9nVrjg5dFcrRAW9lbF9q3U7w1fRIpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:00:26.785579Z","bundle_sha256":"084017608237fbcc79b7c2cf511a0c031932b591e73791e60335ee3a5adfe40e"}}