{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","short_pith_number":"pith:GPJPXMZA","canonical_record":{"source":{"id":"2608.10650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-11T08:34:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9c83fea15c16413d409e5a2541df427005e7891153ebe2f897e8a81290890b06","abstract_canon_sha256":"6c0629167e7a16fa7e971d0118d3dc7cf4017cbd095f69c95f8445798a976e96"},"schema_version":"1.0"},"canonical_sha256":"33d2fbb320bd1680185106743f8e9d4b1b39674eb919c3adb3da7311d0f090d2","source":{"kind":"arxiv","id":"2608.10650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10650","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10650v1","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10650","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_12","alias_value":"GPJPXMZAXULI","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_16","alias_value":"GPJPXMZAXULIAGCR","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_8","alias_value":"GPJPXMZA","created_at":"2026-08-12T01:22:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"record","payload":{"canonical_record":{"source":{"id":"2608.10650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-11T08:34:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9c83fea15c16413d409e5a2541df427005e7891153ebe2f897e8a81290890b06","abstract_canon_sha256":"6c0629167e7a16fa7e971d0118d3dc7cf4017cbd095f69c95f8445798a976e96"},"schema_version":"1.0"},"canonical_sha256":"33d2fbb320bd1680185106743f8e9d4b1b39674eb919c3adb3da7311d0f090d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:22:56.943804Z","signature_b64":"juNW41PLExSH2+6jgguUES/igo+9av8Q3gQqb7SmtVrVC+rrz5/X2Iuzscq3R+j3bENYyozqhtKXGAy3hML3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d2fbb320bd1680185106743f8e9d4b1b39674eb919c3adb3da7311d0f090d2","last_reissued_at":"2026-08-12T01:22:56.942200Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:22:56.942200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.10650","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-08-12T01:22:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM0guyc/3sCIA2xfPUS7JeqmYplJCFhH3c6FliHX2DyRqKamg1tBP6WRwiOIpZLTd0QgzCYJKmwJhe6pNFAfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.718172Z"},"content_sha256":"4c654c651317ab0e109603a51e1b4abc993f499402512dd515c6d1e3340fce8a","schema_version":"1.0","event_id":"sha256:4c654c651317ab0e109603a51e1b4abc993f499402512dd515c6d1e3340fce8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Sohaib Afifi","submitted_at":"2026-08-11T08:34:28Z","abstract_excerpt":"Reducing the number of focal elements of a mass function is classically driven by an intrinsic distance, such as Jaccard or Jousselme, that keeps the approximation close to the original as a body of evidence. We consider instead the case where the mass function feeds a linear combinatorial optimisation problem with evidential costs. What should then be preserved is not the closeness of the two mass functions, but the quality of the decision they induce. We introduce a decision-aware approximation that targets the regret of the decision: one decides with the cheaper approximation and is evaluat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10650","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/2608.10650/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-08-12T01:22:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dllsDo4u3PwLyo9LC9Oy6e3qipUCUpSdcXMfkyoOK1kskvgA09LgFMUOXDvf3jNr8yo2l4bcOVTDNE5AOyBoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.718703Z"},"content_sha256":"a6871773d85a834292ae1de19bb238c811a0980a59efec74b3dec1ec5d2e5b22","schema_version":"1.0","event_id":"sha256:a6871773d85a834292ae1de19bb238c811a0980a59efec74b3dec1ec5d2e5b22"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-031-17801-6_14) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Vu, T.A., Afifi, S., Lefèvre, É., Pichon, F.: On modelling and solving the shortest path problem with evidential weights. In: Belief Functions: Theory and Applica- tions (BELIEF 2022). pp. 139–149. Lecture Notes in Computer Science, Springe","arxiv_id":"2608.10650","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-031-17801-6_","reconstructed_doi":"10.1007/978-3-031-17801-6_14"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-12T20:28:08.269789Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-031-17801-6_14","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b4413464918ae20367d460501612aa76468f0f7fa22cacc8a7a701b252b63f0f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19415,"payload_sha256":"c35706ae44b77bac0aa7930b76580707be56a4f039e7db1239a11310ed4fec07","signature_b64":"KtO83TxQrjLocyBb5/96UtNYWoOC3Y+dLOymmsl0yZsaLa2jrRUMhfPUt6PdGgquNpgHzSFUU8PdEaBrMNtIDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T20:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1Rwl3A8Adp0gKyxN+PIxKDV36qMuE5Z5FWsLsj89rMNon25jwM6FkYZ9xfymYvyF6Xv7LC9wjwFafjT+X/DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.722358Z"},"content_sha256":"e26486485329a10d6503ee024ed2cc64a97d79ad56d2f8ea41e471f983c7c733","schema_version":"1.0","event_id":"sha256:e26486485329a10d6503ee024ed2cc64a97d79ad56d2f8ea41e471f983c7c733"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.ijar.2019.03.009 resolves to 'Decision-making with belief functions: A review'. A reader following the printed text alone cannot reach it.","snippet":"Denoeux, T.: Decision-making with belief functions: A review. International Jour- nal of Approximate Reasoning109, 87–110 (2019).https://doi.org/10.1016/j. ijar.2019.03.009","arxiv_id":"2608.10650","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":"Decision-making with belief functions: A review","printed_excerpt":"10.1016/j","reconstructed_doi":"10.1016/j.ijar.2019.03.009"},"severity":"advisory","ref_index":4,"audited_at":"2026-08-12T20:28:08.269789Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ijar.2019.03.009","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a6eeb6a513455ca28a2b33b3431b0480f1ab07ebe2989313410239edac5adf3d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Decision-making with belief functions: A review","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19414,"payload_sha256":"19172571a1f2720ef221ee1e56ba52a9a59248404abc82e5744d612842239d9b","signature_b64":"HaDOWZXoMdTCfulnfprwGncEvyf0jbd4/hCDsnah+aYJ8kZ3fxwbz+eEleackyRkH4gvpdw0nUkCFXyZCWfJDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T20:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZ27/KGgsLgm7pE03PfOkKwYVWKtF0aQdTy7n8ZVxjDZ/WSA+9PJeN9CwfddK9M0XD3BRQvmQuZt7BHPx024DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.722743Z"},"content_sha256":"46527914656dc9fa2bb9c6954e0983333fec29c7aceefe3ac586032e53b9a271","schema_version":"1.0","event_id":"sha256:46527914656dc9fa2bb9c6954e0983333fec29c7aceefe3ac586032e53b9a271"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arXiv.2002.08676) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Berthet, Q., Blondel, M., Teboul, O., Cuturi, M., Vert, J.P., Bach, F.: Learn- ing with differentiable perturbed optimizers. In: Advances in Neural Information Processing Systems (NeurIPS) (2020).https://doi.org/10.48550/arXiv.2002. 08676","arxiv_id":"2608.10650","detector":"doi_compliance","evidence":{"ref_index":2,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.48550/arxiv.2002","reconstructed_doi":"10.48550/arXiv.2002.08676"},"severity":"advisory","ref_index":2,"audited_at":"2026-08-12T20:28:08.269789Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arXiv.2002.08676","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"199ac798a8fb5654bd464ed9a00a419414e79158464176e8236de542aad33e55","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19413,"payload_sha256":"b8560d27512b915e06cf969fd3f9b14211bbfa65524196278a2d26d55d1ae4dc","signature_b64":"pnbPg4133nzB4L0XrH0JjmAJA9EwFo578Fr3D/hh19mGxcmLT6mW/VvLOpaFoBWlLEGrajEx4Y3/5UnpD42BAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T20:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0o37UJ9lfbGfGB3RWRCDyWzlYFi0Q+8OXQphG0hsGm0aA/JyiMtPqhvjEZDaq6XmLOlLT8w4+s4+U9zq177CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.723102Z"},"content_sha256":"858c40f949c1f4e041edab43883a44cec6975717a1e9b56931b08e63528b172b","schema_version":"1.0","event_id":"sha256:858c40f949c1f4e041edab43883a44cec6975717a1e9b56931b08e63528b172b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","target":"integrity","payload":{"note":"Identifier '10.1016/s0888-613x(97' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Bauer, M.: Approximation algorithms and decision making in the Dempster–Shafer theory of evidence: an empirical study. International Journal of Approximate Reasoning17(2–3), 217–237 (1997).https://doi.org/10.1016/S0888-613X(97) 00013-3","arxiv_id":"2608.10650","detector":"doi_compliance","evidence":{"doi":"10.1016/s0888-613x(97","arxiv_id":null,"ref_index":1,"raw_excerpt":"Bauer, M.: Approximation algorithms and decision making in the Dempster–Shafer theory of evidence: an empirical study. International Journal of Approximate Reasoning17(2–3), 217–237 (1997).https://doi.org/10.1016/S0888-613X(97) 00013-3","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":1,"audited_at":"2026-08-12T20:28:08.269789Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0888-613x(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4c8413e5aaa86fd09f27ac4c231fbd2fee7b548926fbc9fbd597c0bd17c185c2","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19412,"payload_sha256":"e6ae2492412b34101c835dceb39bc3e8935f85f99ebb3885b6919eebd312bc75","signature_b64":"F7JXPZYtid3n7GH2GHr8RMwRcAi3Ori3BQL0JNhMA37YhffD5kU7CSR6C6nep9n4MQMHMF4mAVcPzLHauxPhDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T20:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oElz+4jhB+HEqN1l0gQ8AAVPNA6ZQetGoOYwMSH/QqweS6Pww+Y3/+MhvgggPiT/myQ40zBTqYPRpFOf7Gm0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:32:47.723494Z"},"content_sha256":"41daab01eeaf65b2841ac41a6dd8d4761a6c92de0b0bd5f84914d856aab34b7e","schema_version":"1.0","event_id":"sha256:41daab01eeaf65b2841ac41a6dd8d4761a6c92de0b0bd5f84914d856aab34b7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/bundle.json","state_url":"https://pith.science/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/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-19T05:32:47Z","links":{"resolver":"https://pith.science/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM","bundle":"https://pith.science/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/bundle.json","state":"https://pith.science/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPJPXMZAXULIAGCRAZ2D7DU5JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GPJPXMZAXULIAGCRAZ2D7DU5JM","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c0629167e7a16fa7e971d0118d3dc7cf4017cbd095f69c95f8445798a976e96","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-11T08:34:28Z","title_canon_sha256":"9c83fea15c16413d409e5a2541df427005e7891153ebe2f897e8a81290890b06"},"schema_version":"1.0","source":{"id":"2608.10650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10650","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10650v1","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10650","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_12","alias_value":"GPJPXMZAXULI","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_16","alias_value":"GPJPXMZAXULIAGCR","created_at":"2026-08-12T01:22:56Z"},{"alias_kind":"pith_short_8","alias_value":"GPJPXMZA","created_at":"2026-08-12T01:22:56Z"}],"graph_snapshots":[{"event_id":"sha256:a6871773d85a834292ae1de19bb238c811a0980a59efec74b3dec1ec5d2e5b22","target":"graph","created_at":"2026-08-12T01:22:56Z","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/2608.10650/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reducing the number of focal elements of a mass function is classically driven by an intrinsic distance, such as Jaccard or Jousselme, that keeps the approximation close to the original as a body of evidence. We consider instead the case where the mass function feeds a linear combinatorial optimisation problem with evidential costs. What should then be preserved is not the closeness of the two mass functions, but the quality of the decision they induce. We introduce a decision-aware approximation that targets the regret of the decision: one decides with the cheaper approximation and is evaluat","authors_text":"Sohaib Afifi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-11T08:34:28Z","title":"Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10650","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:4c654c651317ab0e109603a51e1b4abc993f499402512dd515c6d1e3340fce8a","target":"record","created_at":"2026-08-12T01:22:56Z","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":"6c0629167e7a16fa7e971d0118d3dc7cf4017cbd095f69c95f8445798a976e96","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-11T08:34:28Z","title_canon_sha256":"9c83fea15c16413d409e5a2541df427005e7891153ebe2f897e8a81290890b06"},"schema_version":"1.0","source":{"id":"2608.10650","kind":"arxiv","version":1}},"canonical_sha256":"33d2fbb320bd1680185106743f8e9d4b1b39674eb919c3adb3da7311d0f090d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d2fbb320bd1680185106743f8e9d4b1b39674eb919c3adb3da7311d0f090d2","first_computed_at":"2026-08-12T01:22:56.942200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:22:56.942200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"juNW41PLExSH2+6jgguUES/igo+9av8Q3gQqb7SmtVrVC+rrz5/X2Iuzscq3R+j3bENYyozqhtKXGAy3hML3BA==","signature_status":"signed_v1","signed_at":"2026-08-12T01:22:56.943804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.10650","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:41daab01eeaf65b2841ac41a6dd8d4761a6c92de0b0bd5f84914d856aab34b7e","sha256:46527914656dc9fa2bb9c6954e0983333fec29c7aceefe3ac586032e53b9a271","sha256:858c40f949c1f4e041edab43883a44cec6975717a1e9b56931b08e63528b172b","sha256:e26486485329a10d6503ee024ed2cc64a97d79ad56d2f8ea41e471f983c7c733"]}],"invalid_events":[],"applied_event_ids":["sha256:4c654c651317ab0e109603a51e1b4abc993f499402512dd515c6d1e3340fce8a","sha256:a6871773d85a834292ae1de19bb238c811a0980a59efec74b3dec1ec5d2e5b22"],"state_sha256":"ddb50d6c4c55a300848e1ee94edd502e5c62784205ef472b84b2b8667ffb9693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAyJzympcFgQWQfusvSCNgRO2OmMaOHKKuvvJZ2dyDWciEUrdwX7+gL0sOFaoQIZFFnWy7WyWZ+Dkv3cSoBMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:32:47.726812Z","bundle_sha256":"ae66b93e24645499c88d6c32e08ea0562607d6882d0f2f007f809fdc13709678"}}