{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C45CH2HJQ57IEXHVMN2BMJCB7T","short_pith_number":"pith:C45CH2HJ","schema_version":"1.0","canonical_sha256":"173a23e8e9877e825cf56374162441fcddd7058b60b3a28b8fb8f5a70e7c4e3e","source":{"kind":"arxiv","id":"2312.04772","version":4},"attestation_state":"computed","paper":{"title":"Remembering to Be Fair: Non-Markovian Fairness in Sequential Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.AI","authors_text":"Elliot Creager, Parand A. Alamdari, Sheila A. McIlraith, Toryn Q. Klassen","submitted_at":"2023-12-08T01:04:36Z","abstract_excerpt":"Fair decision making has largely been studied with respect to a single decision. Here we investigate the notion of fairness in the context of sequential decision making where multiple stakeholders can be affected by the outcomes of decisions. We observe that fairness often depends on the history of the sequential decision-making process, and in this sense that it is inherently non-Markovian. We further observe that fairness often needs to be assessed at time points within the process, not just at the end of the process. To advance our understanding of this class of fairness problems, we explor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2312.04772","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-08T01:04:36Z","cross_cats_sorted":["cs.CY","cs.LG"],"title_canon_sha256":"f2e771098a21eb8832c77ca9999c1484b9fef3b30761bd5522422ccd60cb4cf2","abstract_canon_sha256":"e06e3851dd0f5b4d9824e0fdfd2bae5c3d155f76dab7cac4dc3ad58bb02debb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:08.851795Z","signature_b64":"BiYGuTecvJAOwBnGGBOc8YS9RZEbNL1Rgg4vn0tJUEt3SqbAPOPRNYZw/iSpTk4X/xqnG2Sf3YwVOj3lBohGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"173a23e8e9877e825cf56374162441fcddd7058b60b3a28b8fb8f5a70e7c4e3e","last_reissued_at":"2026-07-05T08:34:08.851292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:08.851292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Remembering to Be Fair: Non-Markovian Fairness in Sequential Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.AI","authors_text":"Elliot Creager, Parand A. Alamdari, Sheila A. McIlraith, Toryn Q. Klassen","submitted_at":"2023-12-08T01:04:36Z","abstract_excerpt":"Fair decision making has largely been studied with respect to a single decision. Here we investigate the notion of fairness in the context of sequential decision making where multiple stakeholders can be affected by the outcomes of decisions. We observe that fairness often depends on the history of the sequential decision-making process, and in this sense that it is inherently non-Markovian. We further observe that fairness often needs to be assessed at time points within the process, not just at the end of the process. To advance our understanding of this class of fairness problems, we explor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04772","kind":"arxiv","version":4},"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/2312.04772/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.04772","created_at":"2026-07-05T08:34:08.851369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04772v4","created_at":"2026-07-05T08:34:08.851369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04772","created_at":"2026-07-05T08:34:08.851369+00:00"},{"alias_kind":"pith_short_12","alias_value":"C45CH2HJQ57I","created_at":"2026-07-05T08:34:08.851369+00:00"},{"alias_kind":"pith_short_16","alias_value":"C45CH2HJQ57IEXHV","created_at":"2026-07-05T08:34:08.851369+00:00"},{"alias_kind":"pith_short_8","alias_value":"C45CH2HJ","created_at":"2026-07-05T08:34:08.851369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09804","citing_title":"Fair Resource Allocation in Weakly Coupled Markov Decision Processes","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T","json":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T.json","graph_json":"https://pith.science/api/pith-number/C45CH2HJQ57IEXHVMN2BMJCB7T/graph.json","events_json":"https://pith.science/api/pith-number/C45CH2HJQ57IEXHVMN2BMJCB7T/events.json","paper":"https://pith.science/paper/C45CH2HJ"},"agent_actions":{"view_html":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T","download_json":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T.json","view_paper":"https://pith.science/paper/C45CH2HJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04772&json=true","fetch_graph":"https://pith.science/api/pith-number/C45CH2HJQ57IEXHVMN2BMJCB7T/graph.json","fetch_events":"https://pith.science/api/pith-number/C45CH2HJQ57IEXHVMN2BMJCB7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T/action/storage_attestation","attest_author":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T/action/author_attestation","sign_citation":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T/action/citation_signature","submit_replication":"https://pith.science/pith/C45CH2HJQ57IEXHVMN2BMJCB7T/action/replication_record"}},"created_at":"2026-07-05T08:34:08.851369+00:00","updated_at":"2026-07-05T08:34:08.851369+00:00"}