{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2RUTCRVIWQRRXOZHZPRK3V7ECZ","short_pith_number":"pith:2RUTCRVI","canonical_record":{"source":{"id":"2102.01188","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-01T21:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"c06e6d310e412a3760bacded5a0245320b6a2b92e323f39dbcf8300d5f6b9b02","abstract_canon_sha256":"9128df492e58c1ec2444c6bc557ba67ad9e9a0656994191dc1438d13b0facb9e"},"schema_version":"1.0"},"canonical_sha256":"d4693146a8b4231bbb27cbe2add7e4165b89c3d89b043fd9729b0a54cbd3cde8","source":{"kind":"arxiv","id":"2102.01188","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01188","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01188v3","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01188","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"2RUTCRVIWQRR","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"2RUTCRVIWQRRXOZH","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"2RUTCRVI","created_at":"2026-07-05T05:20:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2RUTCRVIWQRRXOZHZPRK3V7ECZ","target":"record","payload":{"canonical_record":{"source":{"id":"2102.01188","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-01T21:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"c06e6d310e412a3760bacded5a0245320b6a2b92e323f39dbcf8300d5f6b9b02","abstract_canon_sha256":"9128df492e58c1ec2444c6bc557ba67ad9e9a0656994191dc1438d13b0facb9e"},"schema_version":"1.0"},"canonical_sha256":"d4693146a8b4231bbb27cbe2add7e4165b89c3d89b043fd9729b0a54cbd3cde8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:58.079937Z","signature_b64":"LBNGk5zyX+wTQ7OSgy+HX+KDOj4F6GGBOIZAIa0ZnmYpbpbDHIwpjH9T1xaXShFumSPXc1Qitwlzz+sO+vcGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4693146a8b4231bbb27cbe2add7e4165b89c3d89b043fd9729b0a54cbd3cde8","last_reissued_at":"2026-07-05T05:20:58.079547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:58.079547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.01188","source_version":3,"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-07-05T05:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kl4aEwCpWSbHqmepmj4TRCjvQNY0ukvgO/sjydXeICEvTKaWyRZSdLzKRqNmtxblpsTy3ppo/+tdi/8rGwQ5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:05:59.748325Z"},"content_sha256":"a2b7db77ec5768d54124d647f7504e058c13d562b7325ae75c8c4ca6f6a0f1d4","schema_version":"1.0","event_id":"sha256:a2b7db77ec5768d54124d647f7504e058c13d562b7325ae75c8c4ca6f6a0f1d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2RUTCRVIWQRRXOZHZPRK3V7ECZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Adaptive and Adaptive Two-Sided Search with Fast Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Lebedev, Christian Deppe","submitted_at":"2021-02-01T21:39:16Z","abstract_excerpt":"In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinatorial two-sided search by allowing more moves of the searched object after each test. We give strategies and show that they are optimal. We consider adaptive and non-adaptive strategies. We show the surprising result that with the combinatorial two-sided search on a path graph, the optimal non-adaptive search needs the same number of tests as the corresponding adaptive strategy does. The strategy obtained can also be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01188","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01188/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGKMfSP6aBqzAb4ru6VxKOv0haLLt2jcF1qcA8T8a1VwoV5pprsbXSWumUokC1Ce9edf/KlfXUfMYcq+R+b8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:05:59.748647Z"},"content_sha256":"2fc379b0f0d41422aa7698e8e97a37c817028c610277c740cbc03d6f605c81a4","schema_version":"1.0","event_id":"sha256:2fc379b0f0d41422aa7698e8e97a37c817028c610277c740cbc03d6f605c81a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/bundle.json","state_url":"https://pith.science/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/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-08-07T00:05:59Z","links":{"resolver":"https://pith.science/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ","bundle":"https://pith.science/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/bundle.json","state":"https://pith.science/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RUTCRVIWQRRXOZHZPRK3V7ECZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2RUTCRVIWQRRXOZHZPRK3V7ECZ","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":"9128df492e58c1ec2444c6bc557ba67ad9e9a0656994191dc1438d13b0facb9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-01T21:39:16Z","title_canon_sha256":"c06e6d310e412a3760bacded5a0245320b6a2b92e323f39dbcf8300d5f6b9b02"},"schema_version":"1.0","source":{"id":"2102.01188","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01188","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01188v3","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01188","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"2RUTCRVIWQRR","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"2RUTCRVIWQRRXOZH","created_at":"2026-07-05T05:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"2RUTCRVI","created_at":"2026-07-05T05:20:58Z"}],"graph_snapshots":[{"event_id":"sha256:2fc379b0f0d41422aa7698e8e97a37c817028c610277c740cbc03d6f605c81a4","target":"graph","created_at":"2026-07-05T05:20:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinatorial two-sided search by allowing more moves of the searched object after each test. We give strategies and show that they are optimal. We consider adaptive and non-adaptive strategies. We show the surprising result that with the combinatorial two-sided search on a path graph, the optimal non-adaptive search needs the same number of tests as the corresponding adaptive strategy does. The strategy obtained can also be","authors_text":"Alexey Lebedev, Christian Deppe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-01T21:39:16Z","title":"Non-Adaptive and Adaptive Two-Sided Search with Fast Objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01188","kind":"arxiv","version":3},"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:a2b7db77ec5768d54124d647f7504e058c13d562b7325ae75c8c4ca6f6a0f1d4","target":"record","created_at":"2026-07-05T05:20:58Z","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":"9128df492e58c1ec2444c6bc557ba67ad9e9a0656994191dc1438d13b0facb9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-01T21:39:16Z","title_canon_sha256":"c06e6d310e412a3760bacded5a0245320b6a2b92e323f39dbcf8300d5f6b9b02"},"schema_version":"1.0","source":{"id":"2102.01188","kind":"arxiv","version":3}},"canonical_sha256":"d4693146a8b4231bbb27cbe2add7e4165b89c3d89b043fd9729b0a54cbd3cde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4693146a8b4231bbb27cbe2add7e4165b89c3d89b043fd9729b0a54cbd3cde8","first_computed_at":"2026-07-05T05:20:58.079547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:58.079547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LBNGk5zyX+wTQ7OSgy+HX+KDOj4F6GGBOIZAIa0ZnmYpbpbDHIwpjH9T1xaXShFumSPXc1Qitwlzz+sO+vcGDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:58.079937Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01188","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2b7db77ec5768d54124d647f7504e058c13d562b7325ae75c8c4ca6f6a0f1d4","sha256:2fc379b0f0d41422aa7698e8e97a37c817028c610277c740cbc03d6f605c81a4"],"state_sha256":"e376f1b4aae11c3a5869b1ab676d1123c8713bbe2d2a30818ec77d1a7dd9d232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ciGb88FuZ1WYxAIPk84pB28YGwLI1kXiAsFIZPfvQTdH6MjhaRmNeXbzCqsMcZnuo06CW5eUMOLHHQGNlnXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:05:59.752342Z","bundle_sha256":"aacd9e7fab86be95bb0f53fd114603f444a57d5e607617525c9781519dfbe4ff"}}