{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KU6NP4CZODOW3KIO4X7XI2DCYS","short_pith_number":"pith:KU6NP4CZ","canonical_record":{"source":{"id":"1809.05234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-14T02:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"ec84642e2482869697262c89fb368653ef3c0b43346c8b87ba2650faeb5a1379","abstract_canon_sha256":"11fdac7aaf204da832a42b71378f3a2ac429d8d19547e93a531940bbc33ab7ac"},"schema_version":"1.0"},"canonical_sha256":"553cd7f05970dd6da90ee5ff746862c49e32b3c180af3be5ac183e2ab939a7ce","source":{"kind":"arxiv","id":"1809.05234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05234","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05234v1","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05234","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"KU6NP4CZODOW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KU6NP4CZODOW3KIO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KU6NP4CZ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KU6NP4CZODOW3KIO4X7XI2DCYS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-14T02:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"ec84642e2482869697262c89fb368653ef3c0b43346c8b87ba2650faeb5a1379","abstract_canon_sha256":"11fdac7aaf204da832a42b71378f3a2ac429d8d19547e93a531940bbc33ab7ac"},"schema_version":"1.0"},"canonical_sha256":"553cd7f05970dd6da90ee5ff746862c49e32b3c180af3be5ac183e2ab939a7ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.322332Z","signature_b64":"9UfGkS6E5ns331lo952Hgg1HGs1BI1G8a8GAdiOE9wzAsAl0Mq3BTpNyU5n9egAQdWZTCb0QEK7OE85anestDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"553cd7f05970dd6da90ee5ff746862c49e32b3c180af3be5ac183e2ab939a7ce","last_reissued_at":"2026-05-18T00:05:44.321513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.321513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05234","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-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJvw+ssHEdrhlIQzwqeXsG92cN8+gMmQX+laQHQxD/hBOWxut0BqYf0DOq3rlddBKbM0bfAFk7qVKRPWiFXBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:29:02.229230Z"},"content_sha256":"6e55b3b5481ae335ebcba8ccf3ab13e30231a14e07beddd61da7ba7c6b68b41a","schema_version":"1.0","event_id":"sha256:6e55b3b5481ae335ebcba8ccf3ab13e30231a14e07beddd61da7ba7c6b68b41a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KU6NP4CZODOW3KIO4X7XI2DCYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-Route Task Selection in Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Camila F. Costa, Mario A. Nascimento","submitted_at":"2018-09-14T02:55:15Z","abstract_excerpt":"One important problem in crowdsourcing is that of assigning tasks to workers. We consider a scenario where a worker is traveling on a preferred/typical path (e.g., from school to home) and there is a set of tasks available to be performed. Furthermore, we assume that: each task yields a positive reward, the worker has the skills necessary to perform all available tasks and he/she is willing to possibly deviate from his/her preferred path as long as he/she travels at most a total given distance/time. We call this problem the In-Route Task Selection (IRTS) problem and investigate it using the sk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05234","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-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXCgJTH/xqS/clSEebv9xrARijCS/ezty4pB4ArV07tQWuuwG7LjWAwl9rVyPI7InTzAZ2rjVRlha9NHMhwVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:29:02.229966Z"},"content_sha256":"dd69cc0acbbad198685cd1426703a67c163ff6182a31fa1731e1bfd67639d40f","schema_version":"1.0","event_id":"sha256:dd69cc0acbbad198685cd1426703a67c163ff6182a31fa1731e1bfd67639d40f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/bundle.json","state_url":"https://pith.science/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/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-09T18:29:02Z","links":{"resolver":"https://pith.science/pith/KU6NP4CZODOW3KIO4X7XI2DCYS","bundle":"https://pith.science/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/bundle.json","state":"https://pith.science/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KU6NP4CZODOW3KIO4X7XI2DCYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KU6NP4CZODOW3KIO4X7XI2DCYS","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":"11fdac7aaf204da832a42b71378f3a2ac429d8d19547e93a531940bbc33ab7ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-14T02:55:15Z","title_canon_sha256":"ec84642e2482869697262c89fb368653ef3c0b43346c8b87ba2650faeb5a1379"},"schema_version":"1.0","source":{"id":"1809.05234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05234","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05234v1","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05234","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"KU6NP4CZODOW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KU6NP4CZODOW3KIO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KU6NP4CZ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:dd69cc0acbbad198685cd1426703a67c163ff6182a31fa1731e1bfd67639d40f","target":"graph","created_at":"2026-05-18T00:05:44Z","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":"One important problem in crowdsourcing is that of assigning tasks to workers. We consider a scenario where a worker is traveling on a preferred/typical path (e.g., from school to home) and there is a set of tasks available to be performed. Furthermore, we assume that: each task yields a positive reward, the worker has the skills necessary to perform all available tasks and he/she is willing to possibly deviate from his/her preferred path as long as he/she travels at most a total given distance/time. We call this problem the In-Route Task Selection (IRTS) problem and investigate it using the sk","authors_text":"Camila F. Costa, Mario A. Nascimento","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-14T02:55:15Z","title":"In-Route Task Selection in Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05234","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:6e55b3b5481ae335ebcba8ccf3ab13e30231a14e07beddd61da7ba7c6b68b41a","target":"record","created_at":"2026-05-18T00:05:44Z","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":"11fdac7aaf204da832a42b71378f3a2ac429d8d19547e93a531940bbc33ab7ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-14T02:55:15Z","title_canon_sha256":"ec84642e2482869697262c89fb368653ef3c0b43346c8b87ba2650faeb5a1379"},"schema_version":"1.0","source":{"id":"1809.05234","kind":"arxiv","version":1}},"canonical_sha256":"553cd7f05970dd6da90ee5ff746862c49e32b3c180af3be5ac183e2ab939a7ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"553cd7f05970dd6da90ee5ff746862c49e32b3c180af3be5ac183e2ab939a7ce","first_computed_at":"2026-05-18T00:05:44.321513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:44.321513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9UfGkS6E5ns331lo952Hgg1HGs1BI1G8a8GAdiOE9wzAsAl0Mq3BTpNyU5n9egAQdWZTCb0QEK7OE85anestDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:44.322332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e55b3b5481ae335ebcba8ccf3ab13e30231a14e07beddd61da7ba7c6b68b41a","sha256:dd69cc0acbbad198685cd1426703a67c163ff6182a31fa1731e1bfd67639d40f"],"state_sha256":"103006c5ba027c2065fa079d4c403571c19fe03a36bb43a40e62a9b7c7c4763f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7ik/S8dQqOFMZW5Qw5DWsea/6XKA7BbnN7NM6EJs/x3mBowCoLtKgMLuMfEGx1jGFb/W0g0P2LwxEW8K8geAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:29:02.234006Z","bundle_sha256":"1d0e614258c6bc63bd752f984daed364ac9c53a61b7b4c284d064cca8e9ec94f"}}