{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SZGIHKJVEJVASCZCXYSALMEEOU","short_pith_number":"pith:SZGIHKJV","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"},"canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","source":{"kind":"arxiv","id":"1601.00479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00479","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00479v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00479","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"SZGIHKJVEJVA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SZGIHKJVEJVASCZC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SZGIHKJV","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SZGIHKJVEJVASCZCXYSALMEEOU","target":"record","payload":{"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"},"canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","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"},"source_kind":"arxiv","source_id":"1601.00479","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-05-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+bJvUuqBYXZUI+r8RlI1qYAaClDKTRzhBRqOtG4fT7vJvqfjYA+HtSGDmROyTz7TMG28TCaQ6YqARI1SG2jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:47:12.951769Z"},"content_sha256":"9be25d85f92ae0493a028341026f0f63322404b9d61e0dcb5780ac7432e23959","schema_version":"1.0","event_id":"sha256:9be25d85f92ae0493a028341026f0f63322404b9d61e0dcb5780ac7432e23959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SZGIHKJVEJVASCZCXYSALMEEOU","target":"graph","payload":{"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"},"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-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GE3p7tjF7lghIcxEbxTwSlINzS/APtN45m2PKbbf5Ivls1CsV1XbkIq2o5nClpJnRx4kc4BClFPwsgV48FqhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:47:12.952176Z"},"content_sha256":"1510de69b33586a84c1bf4dfd54cec1056ac179771578279985eb0f423900ad2","schema_version":"1.0","event_id":"sha256:1510de69b33586a84c1bf4dfd54cec1056ac179771578279985eb0f423900ad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/bundle.json","state_url":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZGIHKJVEJVASCZCXYSALMEEOU/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-10T21:47:12Z","links":{"resolver":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU","bundle":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/bundle.json","state":"https://pith.science/pith/SZGIHKJVEJVASCZCXYSALMEEOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZGIHKJVEJVASCZCXYSALMEEOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SZGIHKJVEJVASCZCXYSALMEEOU","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":"d53ea04576cfdd5b95af9f933268c2f1d13d378788c758e0acf6418c098a905f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-04T12:27:54Z","title_canon_sha256":"24be7d8c9493dd6764db5599c1fe0143e3df8e99e4b453c4d18c7958b9229cd5"},"schema_version":"1.0","source":{"id":"1601.00479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00479","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00479v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00479","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"SZGIHKJVEJVA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SZGIHKJVEJVASCZC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SZGIHKJV","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:1510de69b33586a84c1bf4dfd54cec1056ac179771578279985eb0f423900ad2","target":"graph","created_at":"2026-05-18T01:23:27Z","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":"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","authors_text":"Dennis Kraft, Susanne Albers","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-04T12:27:54Z","title":"Motivating Time-Inconsistent Agents: A Computational Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00479","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:9be25d85f92ae0493a028341026f0f63322404b9d61e0dcb5780ac7432e23959","target":"record","created_at":"2026-05-18T01:23:27Z","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":"d53ea04576cfdd5b95af9f933268c2f1d13d378788c758e0acf6418c098a905f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-04T12:27:54Z","title_canon_sha256":"24be7d8c9493dd6764db5599c1fe0143e3df8e99e4b453c4d18c7958b9229cd5"},"schema_version":"1.0","source":{"id":"1601.00479","kind":"arxiv","version":1}},"canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"964c83a935226a090b22be2405b0847513463b193ee6c1656cd3bd0e2b159b39","first_computed_at":"2026-05-18T01:23:27.322479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:27.322479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yXNh2Jwr3tTEi7FSg9EymQf0IyXOU/B44AZW3uJgpXOpK+ERvXt5jjzjd/4jTLse9AVtPwykwzuLnXvAH9cpAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:27.322999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9be25d85f92ae0493a028341026f0f63322404b9d61e0dcb5780ac7432e23959","sha256:1510de69b33586a84c1bf4dfd54cec1056ac179771578279985eb0f423900ad2"],"state_sha256":"72f323f8c56fa65b04c723741bcba01ad7dd4e92db7022c3af3f88ba5b2cee32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1Fzm8n3WIOuEMyZn7U75QEH55tjrxjiYN9B0nnb96iouMFzlysnSJ8sGOYQwe4uktCOdiaMkdCgfvCDAlYsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:47:12.954145Z","bundle_sha256":"743577a933655edf70c0142471693eeab9ce0f164c3d0bd2b33dae8e95ac8a55"}}