{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S5TMGH6MSGEQ4L3JP4USARO4LI","short_pith_number":"pith:S5TMGH6M","canonical_record":{"source":{"id":"1201.0360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-01T16:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"697a21c715aa0b2d77f40ecb2f10e87ab72bea39d537fa6096468d34d8f82fe4","abstract_canon_sha256":"b5a5a8ec40fc50591380be4aae0e03ca6a2899cacd5408fbb9fe591033c2dc85"},"schema_version":"1.0"},"canonical_sha256":"9766c31fcc91890e2f697f292045dc5a208d5c5d0b941d8292fabbd5bcc846f5","source":{"kind":"arxiv","id":"1201.0360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0360","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0360v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0360","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"S5TMGH6MSGEQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5TMGH6MSGEQ4L3J","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5TMGH6M","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S5TMGH6MSGEQ4L3JP4USARO4LI","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-01T16:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"697a21c715aa0b2d77f40ecb2f10e87ab72bea39d537fa6096468d34d8f82fe4","abstract_canon_sha256":"b5a5a8ec40fc50591380be4aae0e03ca6a2899cacd5408fbb9fe591033c2dc85"},"schema_version":"1.0"},"canonical_sha256":"9766c31fcc91890e2f697f292045dc5a208d5c5d0b941d8292fabbd5bcc846f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:25.430452Z","signature_b64":"nWnGiA8pTfa7oqDIYG4n8miq5rvtmHPu9z/AbMiD9P5byMqXreNZ5rO15HW0OMinwKxVDp32L1xp1GaCrlSfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9766c31fcc91890e2f697f292045dc5a208d5c5d0b941d8292fabbd5bcc846f5","last_reissued_at":"2026-05-18T04:05:25.429850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:25.429850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0360","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:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GPsj4yXqnQnjcbmDXsFChPJoFDYeKdYelDdnV8IhUuCgPmVjJISrlgVI2ZHse0mCyTMFGKhfsCZdlHRrPJRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:05:33.369768Z"},"content_sha256":"83b96a4422575e254754750deced7a318b07fe0b864cfa853ad910268a2eaaa3","schema_version":"1.0","event_id":"sha256:83b96a4422575e254754750deced7a318b07fe0b864cfa853ad910268a2eaaa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S5TMGH6MSGEQ4L3JP4USARO4LI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Performance of Exhaustive Search with Cooperating agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ljupco Krstevski, Toni Stojanovski","submitted_at":"2012-01-01T16:03:49Z","abstract_excerpt":"Despite the occurrence of elegant algorithms for solving complex problem, exhaustive search has retained its significance since many real-life problems exhibit no regular structure and exhaustive search is the only possible solution. The advent of high-performance computing either via multicore processors or distributed processors emphasizes the possibility for exhaustive search by multiple search agents. Here we analyse the performance of exhaustive search when it is conducted by multiple search agents. Several strategies for cooperation between the search agents are evaluated. We discover th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0360","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:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afWH/Jo2OLXHvcY3j+TGRpoERpZxBdms72mQBKokAQWB48NR+fGwFFeH1oN0p2QqoeM0ZUk9y/bek6CfRMeiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:05:33.370107Z"},"content_sha256":"581d7196dcd6d7e0e577c9896e3e6681d9ecc76b2a6c250396755387c39c7f92","schema_version":"1.0","event_id":"sha256:581d7196dcd6d7e0e577c9896e3e6681d9ecc76b2a6c250396755387c39c7f92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/bundle.json","state_url":"https://pith.science/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/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-03T11:05:33Z","links":{"resolver":"https://pith.science/pith/S5TMGH6MSGEQ4L3JP4USARO4LI","bundle":"https://pith.science/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/bundle.json","state":"https://pith.science/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5TMGH6MSGEQ4L3JP4USARO4LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S5TMGH6MSGEQ4L3JP4USARO4LI","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":"b5a5a8ec40fc50591380be4aae0e03ca6a2899cacd5408fbb9fe591033c2dc85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-01T16:03:49Z","title_canon_sha256":"697a21c715aa0b2d77f40ecb2f10e87ab72bea39d537fa6096468d34d8f82fe4"},"schema_version":"1.0","source":{"id":"1201.0360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0360","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0360v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0360","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"S5TMGH6MSGEQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5TMGH6MSGEQ4L3J","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5TMGH6M","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:581d7196dcd6d7e0e577c9896e3e6681d9ecc76b2a6c250396755387c39c7f92","target":"graph","created_at":"2026-05-18T04:05:25Z","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":"Despite the occurrence of elegant algorithms for solving complex problem, exhaustive search has retained its significance since many real-life problems exhibit no regular structure and exhaustive search is the only possible solution. The advent of high-performance computing either via multicore processors or distributed processors emphasizes the possibility for exhaustive search by multiple search agents. Here we analyse the performance of exhaustive search when it is conducted by multiple search agents. Several strategies for cooperation between the search agents are evaluated. We discover th","authors_text":"Ljupco Krstevski, Toni Stojanovski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-01T16:03:49Z","title":"On the Performance of Exhaustive Search with Cooperating agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0360","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:83b96a4422575e254754750deced7a318b07fe0b864cfa853ad910268a2eaaa3","target":"record","created_at":"2026-05-18T04:05:25Z","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":"b5a5a8ec40fc50591380be4aae0e03ca6a2899cacd5408fbb9fe591033c2dc85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-01T16:03:49Z","title_canon_sha256":"697a21c715aa0b2d77f40ecb2f10e87ab72bea39d537fa6096468d34d8f82fe4"},"schema_version":"1.0","source":{"id":"1201.0360","kind":"arxiv","version":1}},"canonical_sha256":"9766c31fcc91890e2f697f292045dc5a208d5c5d0b941d8292fabbd5bcc846f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9766c31fcc91890e2f697f292045dc5a208d5c5d0b941d8292fabbd5bcc846f5","first_computed_at":"2026-05-18T04:05:25.429850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:25.429850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nWnGiA8pTfa7oqDIYG4n8miq5rvtmHPu9z/AbMiD9P5byMqXreNZ5rO15HW0OMinwKxVDp32L1xp1GaCrlSfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:25.430452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b96a4422575e254754750deced7a318b07fe0b864cfa853ad910268a2eaaa3","sha256:581d7196dcd6d7e0e577c9896e3e6681d9ecc76b2a6c250396755387c39c7f92"],"state_sha256":"aa2c19d598015a0497daeb183433071a8d86d9a750f1f38ca75adebc64e4777a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OBnXOt2ysd3SFQMYUC0UE1gdzABYnLxXLN0rULypMOFohb9lqv0h8GcGdV9DHIj6P7UOVgDPNEuJL2rnLLqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:05:33.372354Z","bundle_sha256":"82b1aeae9ec85236f1b76207def374dc3b180f9dbe00b5ea579c271bc4bcaa3a"}}