{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZN5METXFQVEUJ54GHSYVGG2PCE","short_pith_number":"pith:ZN5METXF","canonical_record":{"source":{"id":"1406.5690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-06-22T09:33:21Z","cross_cats_sorted":[],"title_canon_sha256":"5f495dfe48eb07e1e72e54e54717c4e315d01dc8269499e5d39da0425c29eda5","abstract_canon_sha256":"d1a07be34e4dd22f76d828b1cde5bca5d8977604b58cc4bbb24e7f81713e84bd"},"schema_version":"1.0"},"canonical_sha256":"cb7ac24ee5854944f7863cb1531b4f1109291ef0ea1274b6fe5e24eb991f26fe","source":{"kind":"arxiv","id":"1406.5690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5690","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5690v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5690","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZN5METXFQVEU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZN5METXFQVEUJ54G","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZN5METXF","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZN5METXFQVEUJ54GHSYVGG2PCE","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-06-22T09:33:21Z","cross_cats_sorted":[],"title_canon_sha256":"5f495dfe48eb07e1e72e54e54717c4e315d01dc8269499e5d39da0425c29eda5","abstract_canon_sha256":"d1a07be34e4dd22f76d828b1cde5bca5d8977604b58cc4bbb24e7f81713e84bd"},"schema_version":"1.0"},"canonical_sha256":"cb7ac24ee5854944f7863cb1531b4f1109291ef0ea1274b6fe5e24eb991f26fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:10.953226Z","signature_b64":"otN34Sf8gQiKrWGu/JcMfUyL2KxCi4qKAsS/PgM3+Pk1gOG2zHIHEbf+dRYJNzMRhgdqLe/5ODXr2iudNM9cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb7ac24ee5854944f7863cb1531b4f1109291ef0ea1274b6fe5e24eb991f26fe","last_reissued_at":"2026-05-18T02:49:10.952659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:10.952659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5690","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-18T02: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":"RyVUvmd9uxBCRv/+aQVHfXnDCJbMOMxmF/IjxqvlUn26b2w/W4vr9+uST9HZxn+maPjO7I8JWiB9cI7o3hTPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:19:22.231325Z"},"content_sha256":"002a1ab4d7f4a710c0c2e5bec17a00bc060deee470dadb67625c7c4dec32b5b0","schema_version":"1.0","event_id":"sha256:002a1ab4d7f4a710c0c2e5bec17a00bc060deee470dadb67625c7c4dec32b5b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZN5METXFQVEUJ54GHSYVGG2PCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"WebParF: A Web partitioning framework for Parallel Crawlers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Komal Kumar Bhatia, Pikakshi Manchanda, Sonali Gupta","submitted_at":"2014-06-22T09:33:21Z","abstract_excerpt":"With the ever proliferating size and scale of the WWW [1] efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this era of tera and multi-core processors, we ought to think of multi-threaded processes as a serving solution. So, even better how can we improve the crawling performance by using parallel crawlers that work independently? The paper devotes to the fundamental development in the field of parallel crawlers [4] highlighting the advantages and challenges arising from its design. The paper also focu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5690","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-18T02: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":"AWExDg0gT5gC/lbE3V2M92+uqLkxzzXlE8qcTBWxdxuIOlxe0BPm3xc5NyAChimstKQ23m2P7Pg6h8JATIh1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:19:22.231691Z"},"content_sha256":"fcf0cb0c58bbf544832e66a98ea4b03c84f52bd53461731905246728625e7925","schema_version":"1.0","event_id":"sha256:fcf0cb0c58bbf544832e66a98ea4b03c84f52bd53461731905246728625e7925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/bundle.json","state_url":"https://pith.science/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/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-07-02T03:19:22Z","links":{"resolver":"https://pith.science/pith/ZN5METXFQVEUJ54GHSYVGG2PCE","bundle":"https://pith.science/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/bundle.json","state":"https://pith.science/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZN5METXFQVEUJ54GHSYVGG2PCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZN5METXFQVEUJ54GHSYVGG2PCE","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":"d1a07be34e4dd22f76d828b1cde5bca5d8977604b58cc4bbb24e7f81713e84bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-06-22T09:33:21Z","title_canon_sha256":"5f495dfe48eb07e1e72e54e54717c4e315d01dc8269499e5d39da0425c29eda5"},"schema_version":"1.0","source":{"id":"1406.5690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5690","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5690v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5690","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZN5METXFQVEU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZN5METXFQVEUJ54G","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZN5METXF","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:fcf0cb0c58bbf544832e66a98ea4b03c84f52bd53461731905246728625e7925","target":"graph","created_at":"2026-05-18T02: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":"With the ever proliferating size and scale of the WWW [1] efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this era of tera and multi-core processors, we ought to think of multi-threaded processes as a serving solution. So, even better how can we improve the crawling performance by using parallel crawlers that work independently? The paper devotes to the fundamental development in the field of parallel crawlers [4] highlighting the advantages and challenges arising from its design. The paper also focu","authors_text":"Komal Kumar Bhatia, Pikakshi Manchanda, Sonali Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-06-22T09:33:21Z","title":"WebParF: A Web partitioning framework for Parallel Crawlers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5690","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:002a1ab4d7f4a710c0c2e5bec17a00bc060deee470dadb67625c7c4dec32b5b0","target":"record","created_at":"2026-05-18T02: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":"d1a07be34e4dd22f76d828b1cde5bca5d8977604b58cc4bbb24e7f81713e84bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-06-22T09:33:21Z","title_canon_sha256":"5f495dfe48eb07e1e72e54e54717c4e315d01dc8269499e5d39da0425c29eda5"},"schema_version":"1.0","source":{"id":"1406.5690","kind":"arxiv","version":1}},"canonical_sha256":"cb7ac24ee5854944f7863cb1531b4f1109291ef0ea1274b6fe5e24eb991f26fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb7ac24ee5854944f7863cb1531b4f1109291ef0ea1274b6fe5e24eb991f26fe","first_computed_at":"2026-05-18T02:49:10.952659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:10.952659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"otN34Sf8gQiKrWGu/JcMfUyL2KxCi4qKAsS/PgM3+Pk1gOG2zHIHEbf+dRYJNzMRhgdqLe/5ODXr2iudNM9cDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:10.953226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:002a1ab4d7f4a710c0c2e5bec17a00bc060deee470dadb67625c7c4dec32b5b0","sha256:fcf0cb0c58bbf544832e66a98ea4b03c84f52bd53461731905246728625e7925"],"state_sha256":"15b2bff6c54e0e84e7ca3a8859996d0969fce37aa534ff0a4518b38bd9d0746c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFA1Mklkq8rPeYAuX7teEBb4ysgBMVRH73cnboz1xa2l3pMwnr1KHMf5Rspwjex5xz/qnTOuM1R/bfhr4LzhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T03:19:22.234184Z","bundle_sha256":"d08d0c484212dfc77b2e705e889b7980a43c94929992f391ac673ab7164cc00b"}}