{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6N4YB5BJTHMFKCKFVWHSSP4DG5","short_pith_number":"pith:6N4YB5BJ","canonical_record":{"source":{"id":"2107.06869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-08T06:19:18Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"a94ee92c4c77be73aac1d21b5ed15eae0ff39c0e0cc043b583bc35dfc7792329","abstract_canon_sha256":"445b07fc9f0f4b34a08541a5f86b421fd7d83d37679418645c8c1f78aa91f7a2"},"schema_version":"1.0"},"canonical_sha256":"f37980f42999d8550945ad8f293f833778623c7642932635e1a270c42147a88e","source":{"kind":"arxiv","id":"2107.06869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06869","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06869v1","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06869","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"6N4YB5BJTHMF","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"6N4YB5BJTHMFKCKF","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"6N4YB5BJ","created_at":"2026-07-05T02:58:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6N4YB5BJTHMFKCKFVWHSSP4DG5","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-08T06:19:18Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"a94ee92c4c77be73aac1d21b5ed15eae0ff39c0e0cc043b583bc35dfc7792329","abstract_canon_sha256":"445b07fc9f0f4b34a08541a5f86b421fd7d83d37679418645c8c1f78aa91f7a2"},"schema_version":"1.0"},"canonical_sha256":"f37980f42999d8550945ad8f293f833778623c7642932635e1a270c42147a88e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:02.296028Z","signature_b64":"Ymvlf++aihzpAYls6ch3oTH9FdbLsFmVriHKFobgDxmBRoMPgQTCQK1ix1HBcIHLst+36JIY4WuBS/4LHCNiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f37980f42999d8550945ad8f293f833778623c7642932635e1a270c42147a88e","last_reissued_at":"2026-07-05T02:58:02.295547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:02.295547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06869","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-05T02:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8gy/NvvwxLDUwRHILheALwERVUPhcbLDSwsdBjd/X5WntlqNg416CS6Z3CRbpeoQrCCB5cqNUf0ZEX5X5cNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:41:01.350909Z"},"content_sha256":"a0c8be9e2dca9c93fb0ff39c91af9158fd676235f2b3e569895cae78ae674ad3","schema_version":"1.0","event_id":"sha256:a0c8be9e2dca9c93fb0ff39c91af9158fd676235f2b3e569895cae78ae674ad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6N4YB5BJTHMFKCKFVWHSSP4DG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Core-set Sampling for Efficient Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Jae-hun Shim, Kyeongbo Kong, Suk-Ju Kang","submitted_at":"2021-07-08T06:19:18Z","abstract_excerpt":"Neural architecture search (NAS), an important branch of automatic machine learning, has become an effective approach to automate the design of deep learning models. However, the major issue in NAS is how to reduce the large search time imposed by the heavy computational burden. While most recent approaches focus on pruning redundant sets or developing new search methodologies, this paper attempts to formulate the problem based on the data curation manner. Our key strategy is to search the architecture using summarized data distribution, i.e., core-set. Typically, many NAS algorithms separate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06869","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/2107.06869/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-05T02:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ntgNIcHjzJiviNcKs0VK/p9JadteYfCYgMBA+AinkmzbRclLtoACU7Ee+4bc7Cj0AQAI1ms5sFU903gnIM4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:41:01.351281Z"},"content_sha256":"0436371be17abe780b10cef5fa60d2a46b50ddf74d067192d6cad5d406a4d4a6","schema_version":"1.0","event_id":"sha256:0436371be17abe780b10cef5fa60d2a46b50ddf74d067192d6cad5d406a4d4a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/bundle.json","state_url":"https://pith.science/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/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-05T07:41:01Z","links":{"resolver":"https://pith.science/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5","bundle":"https://pith.science/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/bundle.json","state":"https://pith.science/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6N4YB5BJTHMFKCKFVWHSSP4DG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6N4YB5BJTHMFKCKFVWHSSP4DG5","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":"445b07fc9f0f4b34a08541a5f86b421fd7d83d37679418645c8c1f78aa91f7a2","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-08T06:19:18Z","title_canon_sha256":"a94ee92c4c77be73aac1d21b5ed15eae0ff39c0e0cc043b583bc35dfc7792329"},"schema_version":"1.0","source":{"id":"2107.06869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06869","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06869v1","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06869","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"6N4YB5BJTHMF","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"6N4YB5BJTHMFKCKF","created_at":"2026-07-05T02:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"6N4YB5BJ","created_at":"2026-07-05T02:58:02Z"}],"graph_snapshots":[{"event_id":"sha256:0436371be17abe780b10cef5fa60d2a46b50ddf74d067192d6cad5d406a4d4a6","target":"graph","created_at":"2026-07-05T02:58:02Z","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/2107.06869/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural architecture search (NAS), an important branch of automatic machine learning, has become an effective approach to automate the design of deep learning models. However, the major issue in NAS is how to reduce the large search time imposed by the heavy computational burden. While most recent approaches focus on pruning redundant sets or developing new search methodologies, this paper attempts to formulate the problem based on the data curation manner. Our key strategy is to search the architecture using summarized data distribution, i.e., core-set. Typically, many NAS algorithms separate ","authors_text":"Jae-hun Shim, Kyeongbo Kong, Suk-Ju Kang","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-08T06:19:18Z","title":"Core-set Sampling for Efficient Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06869","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:a0c8be9e2dca9c93fb0ff39c91af9158fd676235f2b3e569895cae78ae674ad3","target":"record","created_at":"2026-07-05T02:58:02Z","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":"445b07fc9f0f4b34a08541a5f86b421fd7d83d37679418645c8c1f78aa91f7a2","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-08T06:19:18Z","title_canon_sha256":"a94ee92c4c77be73aac1d21b5ed15eae0ff39c0e0cc043b583bc35dfc7792329"},"schema_version":"1.0","source":{"id":"2107.06869","kind":"arxiv","version":1}},"canonical_sha256":"f37980f42999d8550945ad8f293f833778623c7642932635e1a270c42147a88e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f37980f42999d8550945ad8f293f833778623c7642932635e1a270c42147a88e","first_computed_at":"2026-07-05T02:58:02.295547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:02.295547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ymvlf++aihzpAYls6ch3oTH9FdbLsFmVriHKFobgDxmBRoMPgQTCQK1ix1HBcIHLst+36JIY4WuBS/4LHCNiAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:02.296028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0c8be9e2dca9c93fb0ff39c91af9158fd676235f2b3e569895cae78ae674ad3","sha256:0436371be17abe780b10cef5fa60d2a46b50ddf74d067192d6cad5d406a4d4a6"],"state_sha256":"d943e6aefbfa2f4be70803b53307e6839ab9f9afd7f7edc2d67ba555955704cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKYA9mfwqmfpbaq3r2Xz2VpGPKVeuTB0s8CuYjgWRJR4FbiVQYinDxyZSh3qZH8J0Gag+BsVTVMnoxf4eOYnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:41:01.353194Z","bundle_sha256":"c96fa0361d06a424a66a0259ce2e92e1daf07f411bba03eaea6eb467849f0bd6"}}