{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LBHRZYGSQBNZHCU6DKVUV6QQOA","short_pith_number":"pith:LBHRZYGS","canonical_record":{"source":{"id":"1605.09068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T21:50:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30d66dbc11be20dbc71c841028bdf2fef4ca480fb2969e1719526dfd97119a35","abstract_canon_sha256":"eee497bdc79882baef9ae7e2207eb58e43c50423af68b8fe45392174287447d6"},"schema_version":"1.0"},"canonical_sha256":"584f1ce0d2805b938a9e1aab4afa10701c0fa4b99983b68238a7f3ff6685dd58","source":{"kind":"arxiv","id":"1605.09068","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09068","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09068v3","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09068","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"LBHRZYGSQBNZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBHRZYGSQBNZHCU6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBHRZYGS","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LBHRZYGSQBNZHCU6DKVUV6QQOA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T21:50:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30d66dbc11be20dbc71c841028bdf2fef4ca480fb2969e1719526dfd97119a35","abstract_canon_sha256":"eee497bdc79882baef9ae7e2207eb58e43c50423af68b8fe45392174287447d6"},"schema_version":"1.0"},"canonical_sha256":"584f1ce0d2805b938a9e1aab4afa10701c0fa4b99983b68238a7f3ff6685dd58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:44.414728Z","signature_b64":"cf3VF4I3pfZNkNjVywnBZOIPKpc9zut5K5Fbz+94gZHcYhImVBPhAn3wJAx1DM8Vl3FDP2a8a/ASCxDfuubZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"584f1ce0d2805b938a9e1aab4afa10701c0fa4b99983b68238a7f3ff6685dd58","last_reissued_at":"2026-05-18T00:42:44.414158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:44.414158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09068","source_version":3,"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mtax2xluSkIYgeZ2m66SxYmmcy/De02TW/opX6fF4fJGF4HZ1v6fFjb0dEs+mji7Z7tS/nk5oOT3dlnGuU6vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:58.676446Z"},"content_sha256":"43d690010b994ecddecc359c4ae367ee1ef4ef67ac7468889092ffab466d3907","schema_version":"1.0","event_id":"sha256:43d690010b994ecddecc359c4ae367ee1ef4ef67ac7468889092ffab466d3907"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LBHRZYGSQBNZHCU6DKVUV6QQOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A budget-constrained inverse classification framework for smooth classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jennifer G. Robinson, Michael T. Lash, Qihang Lin, W. Nick Street","submitted_at":"2016-05-29T21:50:25Z","abstract_excerpt":"Inverse classification is the process of manipulating an instance such that it is more likely to conform to a specific class. Past methods that address such a problem have shortcomings. Greedy methods make changes that are overly radical, often relying on data that is strictly discrete. Other methods rely on certain data points, the presence of which cannot be guaranteed. In this paper we propose a general framework and method that overcomes these and other limitations. The formulation of our method can use any differentiable classification function. We demonstrate the method by using logistic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09068","kind":"arxiv","version":3},"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVajabN1ydUoogaYR3D9P7cz16hCFU5Xz6IRHyzfruFShe6QMQKv/2R+/9D84kNfjdTbjG0p7abhk5b4ZDn0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:58.676789Z"},"content_sha256":"8c3604ba45dc173cf769ca3814b9923fd7f799df7e200053e4eaf70896aadc20","schema_version":"1.0","event_id":"sha256:8c3604ba45dc173cf769ca3814b9923fd7f799df7e200053e4eaf70896aadc20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/bundle.json","state_url":"https://pith.science/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/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-02T10:26:58Z","links":{"resolver":"https://pith.science/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA","bundle":"https://pith.science/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/bundle.json","state":"https://pith.science/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBHRZYGSQBNZHCU6DKVUV6QQOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LBHRZYGSQBNZHCU6DKVUV6QQOA","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":"eee497bdc79882baef9ae7e2207eb58e43c50423af68b8fe45392174287447d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T21:50:25Z","title_canon_sha256":"30d66dbc11be20dbc71c841028bdf2fef4ca480fb2969e1719526dfd97119a35"},"schema_version":"1.0","source":{"id":"1605.09068","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09068","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09068v3","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09068","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"LBHRZYGSQBNZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBHRZYGSQBNZHCU6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBHRZYGS","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:8c3604ba45dc173cf769ca3814b9923fd7f799df7e200053e4eaf70896aadc20","target":"graph","created_at":"2026-05-18T00:42:44Z","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":"Inverse classification is the process of manipulating an instance such that it is more likely to conform to a specific class. Past methods that address such a problem have shortcomings. Greedy methods make changes that are overly radical, often relying on data that is strictly discrete. Other methods rely on certain data points, the presence of which cannot be guaranteed. In this paper we propose a general framework and method that overcomes these and other limitations. The formulation of our method can use any differentiable classification function. We demonstrate the method by using logistic","authors_text":"Jennifer G. Robinson, Michael T. Lash, Qihang Lin, W. Nick Street","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T21:50:25Z","title":"A budget-constrained inverse classification framework for smooth classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09068","kind":"arxiv","version":3},"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:43d690010b994ecddecc359c4ae367ee1ef4ef67ac7468889092ffab466d3907","target":"record","created_at":"2026-05-18T00:42:44Z","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":"eee497bdc79882baef9ae7e2207eb58e43c50423af68b8fe45392174287447d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T21:50:25Z","title_canon_sha256":"30d66dbc11be20dbc71c841028bdf2fef4ca480fb2969e1719526dfd97119a35"},"schema_version":"1.0","source":{"id":"1605.09068","kind":"arxiv","version":3}},"canonical_sha256":"584f1ce0d2805b938a9e1aab4afa10701c0fa4b99983b68238a7f3ff6685dd58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"584f1ce0d2805b938a9e1aab4afa10701c0fa4b99983b68238a7f3ff6685dd58","first_computed_at":"2026-05-18T00:42:44.414158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:44.414158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cf3VF4I3pfZNkNjVywnBZOIPKpc9zut5K5Fbz+94gZHcYhImVBPhAn3wJAx1DM8Vl3FDP2a8a/ASCxDfuubZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:44.414728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09068","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43d690010b994ecddecc359c4ae367ee1ef4ef67ac7468889092ffab466d3907","sha256:8c3604ba45dc173cf769ca3814b9923fd7f799df7e200053e4eaf70896aadc20"],"state_sha256":"c3e8770b8a333c57686bbd6fbc20d110be8ab4f04d165693c1023cf17065568a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5M9j0FJNkc+4d6ArPebB4kQSr/RqJTm05/Rz9b2kVsE1vigH/tRZb14MZZ7RGqjrofaxSTciyXJ7U3h6ttEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:26:58.678727Z","bundle_sha256":"a8b2bde21be41115a784b97fd2a618c91355bbd536a3db13e65cb32e21d0279b"}}