{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NASNPCFFV36ZKE47N23BSVTW55","short_pith_number":"pith:NASNPCFF","canonical_record":{"source":{"id":"1208.0075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"b8fa5a027523f0eea6b584622f9994fea15fc277fb75f1f4424f914a66675c17","abstract_canon_sha256":"7cb551ffbb3e0f97e81fb3c767f018c1329f6c2b521b9ee1c39d74543edd9b97"},"schema_version":"1.0"},"canonical_sha256":"6824d788a5aefd95139f6eb6195676ef67ac35c85b2d29ccd3c8cb527a42fa05","source":{"kind":"arxiv","id":"1208.0075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0075","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0075v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0075","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"NASNPCFFV36Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NASNPCFFV36ZKE47","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NASNPCFF","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NASNPCFFV36ZKE47N23BSVTW55","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"b8fa5a027523f0eea6b584622f9994fea15fc277fb75f1f4424f914a66675c17","abstract_canon_sha256":"7cb551ffbb3e0f97e81fb3c767f018c1329f6c2b521b9ee1c39d74543edd9b97"},"schema_version":"1.0"},"canonical_sha256":"6824d788a5aefd95139f6eb6195676ef67ac35c85b2d29ccd3c8cb527a42fa05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.087856Z","signature_b64":"zox1O+MV7FVHPq9mdAqOQLCxdUER/jvRYKP59hklaBtK+6vAT8jOYjKjakSFlRd8L9d1c+wScVeFueoKn/c+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6824d788a5aefd95139f6eb6195676ef67ac35c85b2d29ccd3c8cb527a42fa05","last_reissued_at":"2026-05-18T03:49:45.087115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.087115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0075","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQz1TEJGnb3XFGanvf2p/BmGNI+wuYCP9etvJLo0W8BD1i1zlb1Hh3ck/JOrDgHTxmPVcVnAATNtV5kyl9AtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:07:14.727935Z"},"content_sha256":"c80020d99832da580d91f5210062d61efc34e89442bfd21cce266b8c37c01b64","schema_version":"1.0","event_id":"sha256:c80020d99832da580d91f5210062d61efc34e89442bfd21cce266b8c37c01b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NASNPCFFV36ZKE47N23BSVTW55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Crawling a Hidden Database in the Web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Cheng Sheng, Nan Zhang, Xin Jin, Yufei Tao","submitted_at":"2012-08-01T03:43:52Z","abstract_excerpt":"A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may answer a query only partially, has prevented hidden databases from being crawled effectively by existing search engines. This paper remedies the problem by giving algorithms to extract all the tuples from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0075","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GR8AA2xntBlrgX2tiiUnPyp54wOp98uo4mUzdlexNfMtTQQ/PDoeR6BkBLqleyhx3pxvqTcYlEyvDeGzIDTHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:07:14.728611Z"},"content_sha256":"d9749fd6f5af8011e697cf5e97c3c0a1c345736f693f72d1734462f58d2f3e6f","schema_version":"1.0","event_id":"sha256:d9749fd6f5af8011e697cf5e97c3c0a1c345736f693f72d1734462f58d2f3e6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NASNPCFFV36ZKE47N23BSVTW55/bundle.json","state_url":"https://pith.science/pith/NASNPCFFV36ZKE47N23BSVTW55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NASNPCFFV36ZKE47N23BSVTW55/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-05-20T00:07:14Z","links":{"resolver":"https://pith.science/pith/NASNPCFFV36ZKE47N23BSVTW55","bundle":"https://pith.science/pith/NASNPCFFV36ZKE47N23BSVTW55/bundle.json","state":"https://pith.science/pith/NASNPCFFV36ZKE47N23BSVTW55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NASNPCFFV36ZKE47N23BSVTW55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NASNPCFFV36ZKE47N23BSVTW55","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":"7cb551ffbb3e0f97e81fb3c767f018c1329f6c2b521b9ee1c39d74543edd9b97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:43:52Z","title_canon_sha256":"b8fa5a027523f0eea6b584622f9994fea15fc277fb75f1f4424f914a66675c17"},"schema_version":"1.0","source":{"id":"1208.0075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0075","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0075v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0075","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"NASNPCFFV36Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NASNPCFFV36ZKE47","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NASNPCFF","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:d9749fd6f5af8011e697cf5e97c3c0a1c345736f693f72d1734462f58d2f3e6f","target":"graph","created_at":"2026-05-18T03:49:45Z","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":"A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may answer a query only partially, has prevented hidden databases from being crawled effectively by existing search engines. This paper remedies the problem by giving algorithms to extract all the tuples from","authors_text":"Cheng Sheng, Nan Zhang, Xin Jin, Yufei Tao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:43:52Z","title":"Optimal Algorithms for Crawling a Hidden Database in the Web"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0075","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:c80020d99832da580d91f5210062d61efc34e89442bfd21cce266b8c37c01b64","target":"record","created_at":"2026-05-18T03:49:45Z","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":"7cb551ffbb3e0f97e81fb3c767f018c1329f6c2b521b9ee1c39d74543edd9b97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:43:52Z","title_canon_sha256":"b8fa5a027523f0eea6b584622f9994fea15fc277fb75f1f4424f914a66675c17"},"schema_version":"1.0","source":{"id":"1208.0075","kind":"arxiv","version":1}},"canonical_sha256":"6824d788a5aefd95139f6eb6195676ef67ac35c85b2d29ccd3c8cb527a42fa05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6824d788a5aefd95139f6eb6195676ef67ac35c85b2d29ccd3c8cb527a42fa05","first_computed_at":"2026-05-18T03:49:45.087115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:45.087115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zox1O+MV7FVHPq9mdAqOQLCxdUER/jvRYKP59hklaBtK+6vAT8jOYjKjakSFlRd8L9d1c+wScVeFueoKn/c+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:45.087856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c80020d99832da580d91f5210062d61efc34e89442bfd21cce266b8c37c01b64","sha256:d9749fd6f5af8011e697cf5e97c3c0a1c345736f693f72d1734462f58d2f3e6f"],"state_sha256":"14f6f46921ed38d7c9989dfb2ce12e059859c26e497043da135dae277d470a92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4APc6IUoNXT358nmeoCaB1tiNwKJGegrWOENcUBzDKB/g4VFZI1mGQkDeBQVpdMOZ7j7y+tP6+8oq1g7uzehDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:07:14.732424Z","bundle_sha256":"2a09f67ecb6563dce1fd82d1370085a9340c9faf6c5822859cc2f85d9ae257a5"}}