{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SZGIHKJVEJVASCZCXYSALMEEOU","short_pith_number":"pith:SZGIHKJV","schema_version":"1.0","canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","source":{"kind":"arxiv","id":"1601.00479","version":1},"attestation_state":"computed","paper":{"title":"Motivating Time-Inconsistent Agents: A Computational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dennis Kraft, Susanne Albers","submitted_at":"2016-01-04T12:27:54Z","abstract_excerpt":"In this paper we investigate the computational complexity of motivating time-inconsistent agents to complete long term projects. We resort to an elegant graph-theoretic model, introduced by Kleinberg and Oren, which consists of a task graph $G$ with $n$ vertices, including a source $s$ and target $t$, and an agent that incrementally constructs a path from $s$ to $t$ in order to collect rewards. The twist is that the agent is present-biased and discounts future costs and rewards by a factor $\\beta\\in [0,1]$. Our design objective is to ensure that the agent reaches $t$ i.e.\\ completes the projec"},"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":"1601.00479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-04T12:27:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"24be7d8c9493dd6764db5599c1fe0143e3df8e99e4b453c4d18c7958b9229cd5","abstract_canon_sha256":"d53ea04576cfdd5b95af9f933268c2f1d13d378788c758e0acf6418c098a905f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:27.322999Z","signature_b64":"yXNh2Jwr3tTEi7FSg9EymQf0IyXOU/B44AZW3uJgpXOpK+ERvXt5jjzjd/4jTLse9AVtPwykwzuLnXvAH9cpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","last_reissued_at":"2026-05-18T01:23:27.322479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:27.322479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motivating Time-Inconsistent Agents: A Computational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dennis Kraft, Susanne Albers","submitted_at":"2016-01-04T12:27:54Z","abstract_excerpt":"In this paper we investigate the computational complexity of motivating time-inconsistent agents to complete long term projects. We resort to an elegant graph-theoretic model, introduced by Kleinberg and Oren, which consists of a task graph $G$ with $n$ vertices, including a source $s$ and target $t$, and an agent that incrementally constructs a path from $s$ to $t$ in order to collect rewards. The twist is that the agent is present-biased and discounts future costs and rewards by a factor $\\beta\\in [0,1]$. Our design objective is to ensure that the agent reaches $t$ i.e.\\ completes the projec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00479","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.00479","created_at":"2026-05-18T01:23:27.322566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00479v1","created_at":"2026-05-18T01:23:27.322566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00479","created_at":"2026-05-18T01:23:27.322566+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZGIHKJVEJVA","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZGIHKJVEJVASCZC","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZGIHKJV","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU","json":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU.json","graph_json":"https://pith.science/api/pith-number/SZGIHKJVEJVASCZCXYSALMEEOU/graph.json","events_json":"https://pith.science/api/pith-number/SZGIHKJVEJVASCZCXYSALMEEOU/events.json","paper":"https://pith.science/paper/SZGIHKJV"},"agent_actions":{"view_html":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU","download_json":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU.json","view_paper":"https://pith.science/paper/SZGIHKJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00479&json=true","fetch_graph":"https://pith.science/api/pith-number/SZGIHKJVEJVASCZCXYSALMEEOU/graph.json","fetch_events":"https://pith.science/api/pith-number/SZGIHKJVEJVASCZCXYSALMEEOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/action/storage_attestation","attest_author":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/action/author_attestation","sign_citation":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/action/citation_signature","submit_replication":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/action/replication_record"}},"created_at":"2026-05-18T01:23:27.322566+00:00","updated_at":"2026-05-18T01:23:27.322566+00:00"}