{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7KWHDKDFD4KMDQOGOF42FPXM57","short_pith_number":"pith:7KWHDKDF","schema_version":"1.0","canonical_sha256":"faac71a8651f14c1c1c67179a2beecefe8c0fb5448e52b071cd722ba6c760429","source":{"kind":"arxiv","id":"1611.08037","version":2},"attestation_state":"computed","paper":{"title":"A Spatio-Temporal Representation for the Orienteering Problem with Time-Varying Profits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gaurav S. Sukhatme, Kai Yin, Lantao Liu, Zhibei Ma","submitted_at":"2016-11-24T00:07:56Z","abstract_excerpt":"We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given limited time budget. Different from most existing works where the profits are assumed to be static, in this work we investigate a variant that has arbitrary time-dependent profits. Specifically, the profits to be collected change over time and they follow different (e.g., independent) time-varying functions. The problem is of inherent nonlinearity and difficult to solve by existing methods. To tackle the challenge, we"},"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":"1611.08037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-24T00:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"b17b834ddc1dedb383bdf8c891636bde360e8f1d23b7a6a8bcc29007ad636284","abstract_canon_sha256":"2a2049dc1d99f6d7d2f8e7e8799377aef39263c848dc4f2e264ef8803438935a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:07.719752Z","signature_b64":"hOSqyJ/VBtUe+iTIgXgJG9GcbGk+arZu3ICapi/TOkqLoKv5zxtEB97doVBYa138EVTtXVgKiqv+K/s3+1iOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faac71a8651f14c1c1c67179a2beecefe8c0fb5448e52b071cd722ba6c760429","last_reissued_at":"2026-05-18T00:41:07.719189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:07.719189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Spatio-Temporal Representation for the Orienteering Problem with Time-Varying Profits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gaurav S. Sukhatme, Kai Yin, Lantao Liu, Zhibei Ma","submitted_at":"2016-11-24T00:07:56Z","abstract_excerpt":"We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given limited time budget. Different from most existing works where the profits are assumed to be static, in this work we investigate a variant that has arbitrary time-dependent profits. Specifically, the profits to be collected change over time and they follow different (e.g., independent) time-varying functions. The problem is of inherent nonlinearity and difficult to solve by existing methods. To tackle the challenge, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08037","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":""},"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":"1611.08037","created_at":"2026-05-18T00:41:07.719272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08037v2","created_at":"2026-05-18T00:41:07.719272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08037","created_at":"2026-05-18T00:41:07.719272+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KWHDKDFD4KM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KWHDKDFD4KMDQOG","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KWHDKDF","created_at":"2026-05-18T12:30:04.600751+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/7KWHDKDFD4KMDQOGOF42FPXM57","json":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57.json","graph_json":"https://pith.science/api/pith-number/7KWHDKDFD4KMDQOGOF42FPXM57/graph.json","events_json":"https://pith.science/api/pith-number/7KWHDKDFD4KMDQOGOF42FPXM57/events.json","paper":"https://pith.science/paper/7KWHDKDF"},"agent_actions":{"view_html":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57","download_json":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57.json","view_paper":"https://pith.science/paper/7KWHDKDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08037&json=true","fetch_graph":"https://pith.science/api/pith-number/7KWHDKDFD4KMDQOGOF42FPXM57/graph.json","fetch_events":"https://pith.science/api/pith-number/7KWHDKDFD4KMDQOGOF42FPXM57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57/action/storage_attestation","attest_author":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57/action/author_attestation","sign_citation":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57/action/citation_signature","submit_replication":"https://pith.science/pith/7KWHDKDFD4KMDQOGOF42FPXM57/action/replication_record"}},"created_at":"2026-05-18T00:41:07.719272+00:00","updated_at":"2026-05-18T00:41:07.719272+00:00"}