{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IYWHI6WYIJOFQXHDOJNUZFAP4M","short_pith_number":"pith:IYWHI6WY","canonical_record":{"source":{"id":"2205.10403","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-20T18:44:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"bc615066ec3266c79bb0fb5e505c2bfb2aa947c4c57bf27be15d173d6efa6b49","abstract_canon_sha256":"8213e6121861981da4ff7fd7c061f95a8153fdb9213babaf128e33a29758eb7c"},"schema_version":"1.0"},"canonical_sha256":"462c747ad8425c585ce3725b4c940fe30c4473a231ad7fd81b4a759dc01671f0","source":{"kind":"arxiv","id":"2205.10403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10403","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10403v2","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10403","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"IYWHI6WYIJOF","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYWHI6WYIJOFQXHD","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYWHI6WY","created_at":"2026-07-05T06:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IYWHI6WYIJOFQXHDOJNUZFAP4M","target":"record","payload":{"canonical_record":{"source":{"id":"2205.10403","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-20T18:44:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"bc615066ec3266c79bb0fb5e505c2bfb2aa947c4c57bf27be15d173d6efa6b49","abstract_canon_sha256":"8213e6121861981da4ff7fd7c061f95a8153fdb9213babaf128e33a29758eb7c"},"schema_version":"1.0"},"canonical_sha256":"462c747ad8425c585ce3725b4c940fe30c4473a231ad7fd81b4a759dc01671f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:33.268496Z","signature_b64":"dyszpU8UfPqdzuGfY6z5T9YcXOdkaFshOCNsmCLF1YzRHSn10buH1RBZlG/de6qMl7yWFsHKT9NkJ6TZbXLABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"462c747ad8425c585ce3725b4c940fe30c4473a231ad7fd81b4a759dc01671f0","last_reissued_at":"2026-07-05T06:32:33.267971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:33.267971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.10403","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-05T06:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WN5TIOBwVJ2CwnXdaV02ftZUilFmo83A6NlXGjcQ2UH0buYKWDFVwX/n8V0l9dgr6NKNT2TVALfXLgpHtuhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:48:57.442153Z"},"content_sha256":"40f64be3d8134b5f52a8d4065f28aefb9431d76e4d51f5573c2886cf78c65a83","schema_version":"1.0","event_id":"sha256:40f64be3d8134b5f52a8d4065f28aefb9431d76e4d51f5573c2886cf78c65a83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IYWHI6WYIJOFQXHDOJNUZFAP4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Anton Tsitsulin, Bryan Perozzi, Deepak Ramachandran, Hossein Esfandiari, Mehran Kazemi, MohammadHossein Bateni, Vahab Mirrokni","submitted_at":"2022-05-20T18:44:06Z","abstract_excerpt":"Representative Selection (RS) is the problem of finding a small subset of exemplars from a dataset that is representative of the dataset. In this paper, we study RS for attributed graphs, and focus on finding representative nodes that optimize the accuracy of a model trained on the selected representatives. Theoretically, we establish a new hardness result forRS (in the absence of a graph structure) by proving that a particular, highly practical variant of it (RS for Learning) is hard to approximate in polynomial time within any reasonable factor, which implies a significant potential gap betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10403","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/2205.10403/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-05T06:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE7D0YZMTvwN31BG9V8ai989YsTCzJeerprD0stjDhQqIBfzKBFMA9M0t7T0q19hOOomfoC2Z/Od/ov68zsTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:48:57.442688Z"},"content_sha256":"3cfd296cc689c23f96a0d491478ed9518536880cf9a8abbbfbfa9d9b8784ed30","schema_version":"1.0","event_id":"sha256:3cfd296cc689c23f96a0d491478ed9518536880cf9a8abbbfbfa9d9b8784ed30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/bundle.json","state_url":"https://pith.science/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/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-10T23:48:57Z","links":{"resolver":"https://pith.science/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M","bundle":"https://pith.science/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/bundle.json","state":"https://pith.science/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYWHI6WYIJOFQXHDOJNUZFAP4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IYWHI6WYIJOFQXHDOJNUZFAP4M","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":"8213e6121861981da4ff7fd7c061f95a8153fdb9213babaf128e33a29758eb7c","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-20T18:44:06Z","title_canon_sha256":"bc615066ec3266c79bb0fb5e505c2bfb2aa947c4c57bf27be15d173d6efa6b49"},"schema_version":"1.0","source":{"id":"2205.10403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10403","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10403v2","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10403","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"IYWHI6WYIJOF","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYWHI6WYIJOFQXHD","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYWHI6WY","created_at":"2026-07-05T06:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:3cfd296cc689c23f96a0d491478ed9518536880cf9a8abbbfbfa9d9b8784ed30","target":"graph","created_at":"2026-07-05T06:32:33Z","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/2205.10403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Representative Selection (RS) is the problem of finding a small subset of exemplars from a dataset that is representative of the dataset. In this paper, we study RS for attributed graphs, and focus on finding representative nodes that optimize the accuracy of a model trained on the selected representatives. Theoretically, we establish a new hardness result forRS (in the absence of a graph structure) by proving that a particular, highly practical variant of it (RS for Learning) is hard to approximate in polynomial time within any reasonable factor, which implies a significant potential gap betw","authors_text":"Anton Tsitsulin, Bryan Perozzi, Deepak Ramachandran, Hossein Esfandiari, Mehran Kazemi, MohammadHossein Bateni, Vahab Mirrokni","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-20T18:44:06Z","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10403","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:40f64be3d8134b5f52a8d4065f28aefb9431d76e4d51f5573c2886cf78c65a83","target":"record","created_at":"2026-07-05T06:32:33Z","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":"8213e6121861981da4ff7fd7c061f95a8153fdb9213babaf128e33a29758eb7c","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-20T18:44:06Z","title_canon_sha256":"bc615066ec3266c79bb0fb5e505c2bfb2aa947c4c57bf27be15d173d6efa6b49"},"schema_version":"1.0","source":{"id":"2205.10403","kind":"arxiv","version":2}},"canonical_sha256":"462c747ad8425c585ce3725b4c940fe30c4473a231ad7fd81b4a759dc01671f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"462c747ad8425c585ce3725b4c940fe30c4473a231ad7fd81b4a759dc01671f0","first_computed_at":"2026-07-05T06:32:33.267971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:32:33.267971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dyszpU8UfPqdzuGfY6z5T9YcXOdkaFshOCNsmCLF1YzRHSn10buH1RBZlG/de6qMl7yWFsHKT9NkJ6TZbXLABA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:32:33.268496Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.10403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40f64be3d8134b5f52a8d4065f28aefb9431d76e4d51f5573c2886cf78c65a83","sha256:3cfd296cc689c23f96a0d491478ed9518536880cf9a8abbbfbfa9d9b8784ed30"],"state_sha256":"e12bd01125933037e2bb24990bfdbfbf789406be998820a32a769a950068c0d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slPZzOGqA5eZkV9nvLklgK++svmM3gfkCS92SDuSYvZexmqU1fYn16Ot746oPz02prTz1cVyoMNbrdc4yZymDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T23:48:57.452790Z","bundle_sha256":"77b6ed4509e292cf382dacb950a6ed506d0c43842c3e957eaa1859c126505f7e"}}