{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WDUUSFZYMAG6RZ7GN4ZOLDDDNX","short_pith_number":"pith:WDUUSFZY","canonical_record":{"source":{"id":"1103.3102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-16T05:51:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9647da9d6c8fa41de58e6ffd8bfd9d664005c6cd80a160aa09b6ec10d5c3d8ed","abstract_canon_sha256":"1930397a6055245e839f3c934109757ae2c546e67f9d72843c374c54db1f26df"},"schema_version":"1.0"},"canonical_sha256":"b0e9491738600de8e7e66f32e58c636ddebadda43d9752797eb4a2e093437aa6","source":{"kind":"arxiv","id":"1103.3102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3102","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3102v1","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3102","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDUUSFZYMAG6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WDUUSFZYMAG6RZ7G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WDUUSFZY","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WDUUSFZYMAG6RZ7GN4ZOLDDDNX","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-16T05:51:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9647da9d6c8fa41de58e6ffd8bfd9d664005c6cd80a160aa09b6ec10d5c3d8ed","abstract_canon_sha256":"1930397a6055245e839f3c934109757ae2c546e67f9d72843c374c54db1f26df"},"schema_version":"1.0"},"canonical_sha256":"b0e9491738600de8e7e66f32e58c636ddebadda43d9752797eb4a2e093437aa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:44.809779Z","signature_b64":"qBtoXXA7rWsEe8VUnzMNa0b7frxY2T1ID0ETY96fB5UASYa9Y9B32pPMIsvRX4JftZHEOjxvruP6z7qWZncfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e9491738600de8e7e66f32e58c636ddebadda43d9752797eb4a2e093437aa6","last_reissued_at":"2026-05-18T04:26:44.809087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:44.809087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3102","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-18T04:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MpoZV+uiJIxE5ye59E9Q8ueLvPvdsCbBnGbddB6DAIS7xIDdiA9YQLNiINluhjIL/jLCvNzDv52huQfbVLMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:52:12.878838Z"},"content_sha256":"15eebe421bc185cfa576af5bfa349254bc586873466f544384f19e65d05b2bbd","schema_version":"1.0","event_id":"sha256:15eebe421bc185cfa576af5bfa349254bc586873466f544384f19e65d05b2bbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WDUUSFZYMAG6RZ7GN4ZOLDDDNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Human-Assisted Graph Search: It's Okay to Ask Questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Aditya Parameswaran (Stanford University), Anish Das Sarma (Yahoo! Research), Hector Garcia-Molina (Stanford University), Jennifer Widom (Stanford University), Neoklis Polyzotis (UC Santa Cruz)","submitted_at":"2011-03-16T05:51:08Z","abstract_excerpt":"We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form \"Is there a target node that is reachable from the current node?\". This general problem has applications in many domains that can utilize human intelligence, including curation of hierarchies, debugging workflows, image segmentation and categorization, interactive search and filter synthesis. To our knowledge, this work provides the first formal algorithmic study of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3102","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-18T04:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FDO00pecBStOCVQlc8SxQ+vpc/0o+k/wNA8prljCo8xdHzMVSuQ//jLrvXoWWY0rbONiMkFTxgRZr7kBfprDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:52:12.879195Z"},"content_sha256":"16b7cdf6c9d508d65a459d7e3cb9a4a486529f8d92a95dcbb67f65a2037c9d4a","schema_version":"1.0","event_id":"sha256:16b7cdf6c9d508d65a459d7e3cb9a4a486529f8d92a95dcbb67f65a2037c9d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/bundle.json","state_url":"https://pith.science/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/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-03T16:52:12Z","links":{"resolver":"https://pith.science/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX","bundle":"https://pith.science/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/bundle.json","state":"https://pith.science/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDUUSFZYMAG6RZ7GN4ZOLDDDNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WDUUSFZYMAG6RZ7GN4ZOLDDDNX","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":"1930397a6055245e839f3c934109757ae2c546e67f9d72843c374c54db1f26df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-16T05:51:08Z","title_canon_sha256":"9647da9d6c8fa41de58e6ffd8bfd9d664005c6cd80a160aa09b6ec10d5c3d8ed"},"schema_version":"1.0","source":{"id":"1103.3102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3102","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3102v1","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3102","created_at":"2026-05-18T04:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDUUSFZYMAG6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WDUUSFZYMAG6RZ7G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WDUUSFZY","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:16b7cdf6c9d508d65a459d7e3cb9a4a486529f8d92a95dcbb67f65a2037c9d4a","target":"graph","created_at":"2026-05-18T04:26: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":"We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form \"Is there a target node that is reachable from the current node?\". This general problem has applications in many domains that can utilize human intelligence, including curation of hierarchies, debugging workflows, image segmentation and categorization, interactive search and filter synthesis. To our knowledge, this work provides the first formal algorithmic study of th","authors_text":"Aditya Parameswaran (Stanford University), Anish Das Sarma (Yahoo! Research), Hector Garcia-Molina (Stanford University), Jennifer Widom (Stanford University), Neoklis Polyzotis (UC Santa Cruz)","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-16T05:51:08Z","title":"Human-Assisted Graph Search: It's Okay to Ask Questions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3102","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:15eebe421bc185cfa576af5bfa349254bc586873466f544384f19e65d05b2bbd","target":"record","created_at":"2026-05-18T04:26: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":"1930397a6055245e839f3c934109757ae2c546e67f9d72843c374c54db1f26df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-16T05:51:08Z","title_canon_sha256":"9647da9d6c8fa41de58e6ffd8bfd9d664005c6cd80a160aa09b6ec10d5c3d8ed"},"schema_version":"1.0","source":{"id":"1103.3102","kind":"arxiv","version":1}},"canonical_sha256":"b0e9491738600de8e7e66f32e58c636ddebadda43d9752797eb4a2e093437aa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e9491738600de8e7e66f32e58c636ddebadda43d9752797eb4a2e093437aa6","first_computed_at":"2026-05-18T04:26:44.809087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:44.809087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qBtoXXA7rWsEe8VUnzMNa0b7frxY2T1ID0ETY96fB5UASYa9Y9B32pPMIsvRX4JftZHEOjxvruP6z7qWZncfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:44.809779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15eebe421bc185cfa576af5bfa349254bc586873466f544384f19e65d05b2bbd","sha256:16b7cdf6c9d508d65a459d7e3cb9a4a486529f8d92a95dcbb67f65a2037c9d4a"],"state_sha256":"210ad16215609047d44ef4f66d7be08916d6d2c53122e72033a40480e47fb4ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uC2epkq+++aUOELfWT/VuSM3QOFTeWBKS4qCUUoJBTBgvI2Rp16wlshrC5EqlK7AEmE9087CF2+6zc5E0YVwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:52:12.881297Z","bundle_sha256":"732c9fb95a846c11179dab06e0fbc8f3a00642042f37e97067f18d748f599f4f"}}