{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XI7UJZQVZYXLLEQZCNS26QECI2","short_pith_number":"pith:XI7UJZQV","canonical_record":{"source":{"id":"1208.1676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T14:41:39Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6e4a9c344d5da06fecc53f4ca0c6940be9088148553e3fe8180050e67b835bdc","abstract_canon_sha256":"06c6311360bcf214c159e6214cbf774031cb4bc7cbf2dd90284069dad3c60f35"},"schema_version":"1.0"},"canonical_sha256":"ba3f44e615ce2eb592191365af4082469921ddec7dadd119b8e7f63c72173bf5","source":{"kind":"arxiv","id":"1208.1676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1676","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1676v1","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1676","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"XI7UJZQVZYXL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XI7UJZQVZYXLLEQZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XI7UJZQV","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XI7UJZQVZYXLLEQZCNS26QECI2","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T14:41:39Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6e4a9c344d5da06fecc53f4ca0c6940be9088148553e3fe8180050e67b835bdc","abstract_canon_sha256":"06c6311360bcf214c159e6214cbf774031cb4bc7cbf2dd90284069dad3c60f35"},"schema_version":"1.0"},"canonical_sha256":"ba3f44e615ce2eb592191365af4082469921ddec7dadd119b8e7f63c72173bf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.913850Z","signature_b64":"QbNJH2UjU79dsMhDLHo0AKS5zUo54woUc5efJ0ibjq2wVoZN5Y5eF/4sZ78wQxNnJWo2jepw9ELLJMKsOlvzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba3f44e615ce2eb592191365af4082469921ddec7dadd119b8e7f63c72173bf5","last_reissued_at":"2026-05-18T03:49:10.912944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.912944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1676","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z45omtiAdSaYTL3brb2z/AYkaTKyQYKlJ8APyde7YglzKjpemRjOmue4qPDM0Zf5lxq/IBEv6NajwhSI+b7nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:35:18.691871Z"},"content_sha256":"ba77aeb32ff32a644425d8c13ec81cf3df6a882c1f14fa0bd81204179abea1ac","schema_version":"1.0","event_id":"sha256:ba77aeb32ff32a644425d8c13ec81cf3df6a882c1f14fa0bd81204179abea1ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XI7UJZQVZYXLLEQZCNS26QECI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mechanism Design for Time Critical and Cost Critical Task Execution via Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Dinesh Garg, James Zou, Pankaj Dayama, Swaprava Nath, Y. Narahari","submitted_at":"2012-08-08T14:41:39Z","abstract_excerpt":"An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an {\\em atomic task} as well as in recruiting other agents to execute the task. We study this mechanism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner's goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1676","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvu00x578KLx7GDFXbyjfW2aiupa3Qf5hM9h97lfMB/wcYfjpmNm3JejsPzfFvFs55A8cLsqNO4ugWRWnIz5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:35:18.692217Z"},"content_sha256":"49df5ef2e53ee56262c4912c1bb809d0f58facd578e1083f260334639a05778f","schema_version":"1.0","event_id":"sha256:49df5ef2e53ee56262c4912c1bb809d0f58facd578e1083f260334639a05778f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XI7UJZQVZYXLLEQZCNS26QECI2/bundle.json","state_url":"https://pith.science/pith/XI7UJZQVZYXLLEQZCNS26QECI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XI7UJZQVZYXLLEQZCNS26QECI2/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-02T06:35:18Z","links":{"resolver":"https://pith.science/pith/XI7UJZQVZYXLLEQZCNS26QECI2","bundle":"https://pith.science/pith/XI7UJZQVZYXLLEQZCNS26QECI2/bundle.json","state":"https://pith.science/pith/XI7UJZQVZYXLLEQZCNS26QECI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XI7UJZQVZYXLLEQZCNS26QECI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XI7UJZQVZYXLLEQZCNS26QECI2","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":"06c6311360bcf214c159e6214cbf774031cb4bc7cbf2dd90284069dad3c60f35","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T14:41:39Z","title_canon_sha256":"6e4a9c344d5da06fecc53f4ca0c6940be9088148553e3fe8180050e67b835bdc"},"schema_version":"1.0","source":{"id":"1208.1676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1676","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1676v1","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1676","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"XI7UJZQVZYXL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XI7UJZQVZYXLLEQZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XI7UJZQV","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:49df5ef2e53ee56262c4912c1bb809d0f58facd578e1083f260334639a05778f","target":"graph","created_at":"2026-05-18T03:49:10Z","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":"An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an {\\em atomic task} as well as in recruiting other agents to execute the task. We study this mechanism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner's goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We i","authors_text":"Dinesh Garg, James Zou, Pankaj Dayama, Swaprava Nath, Y. Narahari","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T14:41:39Z","title":"Mechanism Design for Time Critical and Cost Critical Task Execution via Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1676","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:ba77aeb32ff32a644425d8c13ec81cf3df6a882c1f14fa0bd81204179abea1ac","target":"record","created_at":"2026-05-18T03:49:10Z","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":"06c6311360bcf214c159e6214cbf774031cb4bc7cbf2dd90284069dad3c60f35","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T14:41:39Z","title_canon_sha256":"6e4a9c344d5da06fecc53f4ca0c6940be9088148553e3fe8180050e67b835bdc"},"schema_version":"1.0","source":{"id":"1208.1676","kind":"arxiv","version":1}},"canonical_sha256":"ba3f44e615ce2eb592191365af4082469921ddec7dadd119b8e7f63c72173bf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba3f44e615ce2eb592191365af4082469921ddec7dadd119b8e7f63c72173bf5","first_computed_at":"2026-05-18T03:49:10.912944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:10.912944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QbNJH2UjU79dsMhDLHo0AKS5zUo54woUc5efJ0ibjq2wVoZN5Y5eF/4sZ78wQxNnJWo2jepw9ELLJMKsOlvzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:10.913850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba77aeb32ff32a644425d8c13ec81cf3df6a882c1f14fa0bd81204179abea1ac","sha256:49df5ef2e53ee56262c4912c1bb809d0f58facd578e1083f260334639a05778f"],"state_sha256":"08ff6fca0892b8f6f93a034a40f2f15310b34300be6b605a20564cfd5a9dc75c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfHap4oO8xCuIPyUem8abdBZrCp/Rskul2GPyRFHRLVzVnoLZ7kRrkDZvaUzv1LQqZChHCXDWE9Ax3UaOoD8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:35:18.694140Z","bundle_sha256":"7bf6f8da90b44bddd0a7d8412082e7bec643292792139565d403c01c869d311b"}}