{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VIGRQYXBAFDCE6UGAXEM7FRD4J","short_pith_number":"pith:VIGRQYXB","canonical_record":{"source":{"id":"2205.00570","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-05-01T22:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"77fa76eb022764e2d7fdb623c0befd482cfed4a8e1cd027bc61b14f13984d272","abstract_canon_sha256":"38dee3ad8636087dc0bf44da0769148ae385ec671132311c15c9be8d362334a5"},"schema_version":"1.0"},"canonical_sha256":"aa0d1862e10146227a8605c8cf9623e27f9816c7606c2db4b5c608c72aa41e7c","source":{"kind":"arxiv","id":"2205.00570","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00570","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00570v2","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00570","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"VIGRQYXBAFDC","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"VIGRQYXBAFDCE6UG","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"VIGRQYXB","created_at":"2026-07-05T04:55:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VIGRQYXBAFDCE6UGAXEM7FRD4J","target":"record","payload":{"canonical_record":{"source":{"id":"2205.00570","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-05-01T22:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"77fa76eb022764e2d7fdb623c0befd482cfed4a8e1cd027bc61b14f13984d272","abstract_canon_sha256":"38dee3ad8636087dc0bf44da0769148ae385ec671132311c15c9be8d362334a5"},"schema_version":"1.0"},"canonical_sha256":"aa0d1862e10146227a8605c8cf9623e27f9816c7606c2db4b5c608c72aa41e7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:17.099718Z","signature_b64":"4exBnaKCHfuwnk2TAgTwjzvulxabcKX3xp11SCUJ2KkOaTXoY/YXS4X5wCJY5gNscd3lU79mlbgVHz7VhKdvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0d1862e10146227a8605c8cf9623e27f9816c7606c2db4b5c608c72aa41e7c","last_reissued_at":"2026-07-05T04:55:17.099211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:17.099211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.00570","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-05T04:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJSIeAe65Xzakrouaryagt5KmdVLArlfbT/rP3VvKg8zSCCcnRpSQhe3fWTk4Z/EmuPDiuFgP/DF2+SezsE0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:46.908800Z"},"content_sha256":"c9765526017b1bda7779bb5bd4c60ad966620205571782a142554c90114f4c97","schema_version":"1.0","event_id":"sha256:c9765526017b1bda7779bb5bd4c60ad966620205571782a142554c90114f4c97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VIGRQYXBAFDCE6UGAXEM7FRD4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budgeted Classification with Rejection: An Evolutionary Method with Multiple Objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Errin Fulp, Nolan H. Hamilton","submitted_at":"2022-05-01T22:05:16Z","abstract_excerpt":"Classification systems are often deployed in resource-constrained settings where labels must be assigned to inputs on a budget of time, memory, etc. Budgeted, sequential classifiers (BSCs) address these scenarios by processing inputs through a sequence of partial feature acquisition and evaluation steps with early-exit options. This allows for an efficient evaluation of inputs that prevents unneeded feature acquisition. To approximate an intractable combinatorial problem, current approaches to budgeted classification rely on well-behaved loss functions that account for two primary objectives ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00570","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.00570/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-05T04:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUDUqBdEL5oBx4YCnkHk7wwWDZoZs3QV058lsACh7J0uOciX90a8s4e0vqqiVpvQGkshh4EFhaDfZDk7sGwLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:46.909172Z"},"content_sha256":"d7ad56b4a3fce70ee5e77500185abb4fbf0562a4e3081f7f16c16fe241004de4","schema_version":"1.0","event_id":"sha256:d7ad56b4a3fce70ee5e77500185abb4fbf0562a4e3081f7f16c16fe241004de4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/bundle.json","state_url":"https://pith.science/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/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-08T22:33:46Z","links":{"resolver":"https://pith.science/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J","bundle":"https://pith.science/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/bundle.json","state":"https://pith.science/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIGRQYXBAFDCE6UGAXEM7FRD4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VIGRQYXBAFDCE6UGAXEM7FRD4J","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":"38dee3ad8636087dc0bf44da0769148ae385ec671132311c15c9be8d362334a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-05-01T22:05:16Z","title_canon_sha256":"77fa76eb022764e2d7fdb623c0befd482cfed4a8e1cd027bc61b14f13984d272"},"schema_version":"1.0","source":{"id":"2205.00570","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00570","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00570v2","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00570","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"VIGRQYXBAFDC","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"VIGRQYXBAFDCE6UG","created_at":"2026-07-05T04:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"VIGRQYXB","created_at":"2026-07-05T04:55:17Z"}],"graph_snapshots":[{"event_id":"sha256:d7ad56b4a3fce70ee5e77500185abb4fbf0562a4e3081f7f16c16fe241004de4","target":"graph","created_at":"2026-07-05T04:55:17Z","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.00570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classification systems are often deployed in resource-constrained settings where labels must be assigned to inputs on a budget of time, memory, etc. Budgeted, sequential classifiers (BSCs) address these scenarios by processing inputs through a sequence of partial feature acquisition and evaluation steps with early-exit options. This allows for an efficient evaluation of inputs that prevents unneeded feature acquisition. To approximate an intractable combinatorial problem, current approaches to budgeted classification rely on well-behaved loss functions that account for two primary objectives (","authors_text":"Errin Fulp, Nolan H. Hamilton","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-05-01T22:05:16Z","title":"Budgeted Classification with Rejection: An Evolutionary Method with Multiple Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00570","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:c9765526017b1bda7779bb5bd4c60ad966620205571782a142554c90114f4c97","target":"record","created_at":"2026-07-05T04:55:17Z","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":"38dee3ad8636087dc0bf44da0769148ae385ec671132311c15c9be8d362334a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-05-01T22:05:16Z","title_canon_sha256":"77fa76eb022764e2d7fdb623c0befd482cfed4a8e1cd027bc61b14f13984d272"},"schema_version":"1.0","source":{"id":"2205.00570","kind":"arxiv","version":2}},"canonical_sha256":"aa0d1862e10146227a8605c8cf9623e27f9816c7606c2db4b5c608c72aa41e7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0d1862e10146227a8605c8cf9623e27f9816c7606c2db4b5c608c72aa41e7c","first_computed_at":"2026-07-05T04:55:17.099211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:17.099211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4exBnaKCHfuwnk2TAgTwjzvulxabcKX3xp11SCUJ2KkOaTXoY/YXS4X5wCJY5gNscd3lU79mlbgVHz7VhKdvCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:17.099718Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00570","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9765526017b1bda7779bb5bd4c60ad966620205571782a142554c90114f4c97","sha256:d7ad56b4a3fce70ee5e77500185abb4fbf0562a4e3081f7f16c16fe241004de4"],"state_sha256":"d3be7db401150850113acf744b1f350cb8ce447e46cd83ed18285ca549d7a074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fV1YICEAjcLCOlVOWf3J+4tN4TE5Hst+geOxorP/uFWFrk4sF1t1roL+TrtQQDOoHA4fkUlkoSg0UGsNdmVaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:33:46.911194Z","bundle_sha256":"ed5eaab14a3ed6bb6b1495fb845045d606ebecf41c19b2b4820fa09afed133de"}}