{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FGSROJCQLJAVYHDOOISHDU2CML","short_pith_number":"pith:FGSROJCQ","canonical_record":{"source":{"id":"1905.08170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T15:30:06Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"ec2c2142c4c134331f25dd9425fa7f3d62ae8ee7bbbd7b445cdcd769b544ac83","abstract_canon_sha256":"556f50798e11894d7d974e920a93bfb4635ba8d6db9252bbd1d05e30588606f9"},"schema_version":"1.0"},"canonical_sha256":"29a51724505a415c1c6e722471d34262c5d0606bb4b5f1b2d54520dc4d2a72e3","source":{"kind":"arxiv","id":"1905.08170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08170","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08170v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08170","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"FGSROJCQLJAV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGSROJCQLJAVYHDO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGSROJCQ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FGSROJCQLJAVYHDOOISHDU2CML","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T15:30:06Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"ec2c2142c4c134331f25dd9425fa7f3d62ae8ee7bbbd7b445cdcd769b544ac83","abstract_canon_sha256":"556f50798e11894d7d974e920a93bfb4635ba8d6db9252bbd1d05e30588606f9"},"schema_version":"1.0"},"canonical_sha256":"29a51724505a415c1c6e722471d34262c5d0606bb4b5f1b2d54520dc4d2a72e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.374174Z","signature_b64":"U9GVga5PLbk5xtmB9RjYjGXUjXwtiYEWI3JKVotET46Vp3XgWS3FcXASxZQSn3jZs2r5SNsQ59TIbLKoqES9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a51724505a415c1c6e722471d34262c5d0606bb4b5f1b2d54520dc4d2a72e3","last_reissued_at":"2026-05-17T23:45:47.373696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.373696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08170","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQyXg4VD0wKji9JvQMb6I23TaGJJIBNTq3mQYKSYblQj4i8IZ2hIwWILHRb0IPncD/qVW6eI+Y9V4EDjKu+vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:37:20.945287Z"},"content_sha256":"472c4507113559ee524ef6210a6c96cf479f4eb48af220161f9898d544bb62f7","schema_version":"1.0","event_id":"sha256:472c4507113559ee524ef6210a6c96cf479f4eb48af220161f9898d544bb62f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FGSROJCQLJAVYHDOOISHDU2CML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DARC: Differentiable ARchitecture Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Khetan, Shashank Singh, Zohar Karnin","submitted_at":"2019-05-20T15:30:06Z","abstract_excerpt":"In many learning situations, resources at inference time are significantly more constrained than resources at training time. This paper studies a general paradigm, called Differentiable ARchitecture Compression (DARC), that combines model compression and architecture search to learn models that are resource-efficient at inference time. Given a resource-intensive base architecture, DARC utilizes the training data to learn which sub-components can be replaced by cheaper alternatives. The high-level technique can be applied to any neural architecture, and we report experiments on state-of-the-art"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08170","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W30iBnA/WIVCV7QfD28t7EYugCocukzd6+tqFraa4NFOKgRCFM7nGjYSljtKDZ/tk34jqWH4k4vX4UnRDF1zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:37:20.945630Z"},"content_sha256":"2c5a307d0e1e0e441d9a7f6bb2676ab26fc131b17618ad0a122a9ff7f1cdc802","schema_version":"1.0","event_id":"sha256:2c5a307d0e1e0e441d9a7f6bb2676ab26fc131b17618ad0a122a9ff7f1cdc802"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGSROJCQLJAVYHDOOISHDU2CML/bundle.json","state_url":"https://pith.science/pith/FGSROJCQLJAVYHDOOISHDU2CML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGSROJCQLJAVYHDOOISHDU2CML/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-05-28T09:37:20Z","links":{"resolver":"https://pith.science/pith/FGSROJCQLJAVYHDOOISHDU2CML","bundle":"https://pith.science/pith/FGSROJCQLJAVYHDOOISHDU2CML/bundle.json","state":"https://pith.science/pith/FGSROJCQLJAVYHDOOISHDU2CML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGSROJCQLJAVYHDOOISHDU2CML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FGSROJCQLJAVYHDOOISHDU2CML","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":"556f50798e11894d7d974e920a93bfb4635ba8d6db9252bbd1d05e30588606f9","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T15:30:06Z","title_canon_sha256":"ec2c2142c4c134331f25dd9425fa7f3d62ae8ee7bbbd7b445cdcd769b544ac83"},"schema_version":"1.0","source":{"id":"1905.08170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08170","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08170v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08170","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"FGSROJCQLJAV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGSROJCQLJAVYHDO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGSROJCQ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:2c5a307d0e1e0e441d9a7f6bb2676ab26fc131b17618ad0a122a9ff7f1cdc802","target":"graph","created_at":"2026-05-17T23:45:47Z","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":"In many learning situations, resources at inference time are significantly more constrained than resources at training time. This paper studies a general paradigm, called Differentiable ARchitecture Compression (DARC), that combines model compression and architecture search to learn models that are resource-efficient at inference time. Given a resource-intensive base architecture, DARC utilizes the training data to learn which sub-components can be replaced by cheaper alternatives. The high-level technique can be applied to any neural architecture, and we report experiments on state-of-the-art","authors_text":"Ashish Khetan, Shashank Singh, Zohar Karnin","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T15:30:06Z","title":"DARC: Differentiable ARchitecture Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08170","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:472c4507113559ee524ef6210a6c96cf479f4eb48af220161f9898d544bb62f7","target":"record","created_at":"2026-05-17T23:45:47Z","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":"556f50798e11894d7d974e920a93bfb4635ba8d6db9252bbd1d05e30588606f9","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T15:30:06Z","title_canon_sha256":"ec2c2142c4c134331f25dd9425fa7f3d62ae8ee7bbbd7b445cdcd769b544ac83"},"schema_version":"1.0","source":{"id":"1905.08170","kind":"arxiv","version":1}},"canonical_sha256":"29a51724505a415c1c6e722471d34262c5d0606bb4b5f1b2d54520dc4d2a72e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29a51724505a415c1c6e722471d34262c5d0606bb4b5f1b2d54520dc4d2a72e3","first_computed_at":"2026-05-17T23:45:47.373696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.373696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U9GVga5PLbk5xtmB9RjYjGXUjXwtiYEWI3JKVotET46Vp3XgWS3FcXASxZQSn3jZs2r5SNsQ59TIbLKoqES9BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.374174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:472c4507113559ee524ef6210a6c96cf479f4eb48af220161f9898d544bb62f7","sha256:2c5a307d0e1e0e441d9a7f6bb2676ab26fc131b17618ad0a122a9ff7f1cdc802"],"state_sha256":"23e42916e1bdb7a8bb7075d69f4aa612b65df4b1c30b8c015f17cf1191244f3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fejfsG0e9pf6kFj/weseu424087tSsS8Qt9zfV/ZcJlR/AEw/hxl8JvrBUKOjNaflWvGd3HU+sTeJPmb0JYQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:37:20.947556Z","bundle_sha256":"16338806d2d1ec90dc077cbfe9651325f20fb10a8186ecb5a412417228e9939d"}}