{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZU4DEQSHU23DMKK7BVH3H4WRV6","short_pith_number":"pith:ZU4DEQSH","canonical_record":{"source":{"id":"1410.8756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T14:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"d4ed3f6d4d2a926d2a5efbbf5b4aadc5b54e9d83b0d5368269733ea325924dd9","abstract_canon_sha256":"d86128ea74c5dad4441fba5d655ad6fe0377c8106b930ca3589f15f4bf956986"},"schema_version":"1.0"},"canonical_sha256":"cd38324247a6b636295f0d4fb3f2d1af9125cc40d7d496c648f1cd98faee57a6","source":{"kind":"arxiv","id":"1410.8756","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8756","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8756v3","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8756","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZU4DEQSHU23D","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZU4DEQSHU23DMKK7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZU4DEQSH","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZU4DEQSHU23DMKK7BVH3H4WRV6","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T14:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"d4ed3f6d4d2a926d2a5efbbf5b4aadc5b54e9d83b0d5368269733ea325924dd9","abstract_canon_sha256":"d86128ea74c5dad4441fba5d655ad6fe0377c8106b930ca3589f15f4bf956986"},"schema_version":"1.0"},"canonical_sha256":"cd38324247a6b636295f0d4fb3f2d1af9125cc40d7d496c648f1cd98faee57a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:32.729354Z","signature_b64":"qJmuvZfKgdQPtqDWkvSTfbWBk3ufAK6XcMjLwQvKCpMMI6hhfjUqVpVPd56C7Wli7d9bGEUpb40r9jDkgNMrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd38324247a6b636295f0d4fb3f2d1af9125cc40d7d496c648f1cd98faee57a6","last_reissued_at":"2026-05-18T01:35:32.728748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:32.728748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8756","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-05-18T01:35:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRes8dXkIQycTXheVA6s/4ShkNBHip+/YPXnA3J5mQbUM2Cne6acpxQIU/rlRxcwphvc++6SgQJjXxmaOHNPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:55:56.969264Z"},"content_sha256":"3a6a5da5de6162a1e522a5c5431fce6b873ff4fa3082c9ef6f7277f7a6b380ba","schema_version":"1.0","event_id":"sha256:3a6a5da5de6162a1e522a5c5431fce6b873ff4fa3082c9ef6f7277f7a6b380ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZU4DEQSHU23DMKK7BVH3H4WRV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contraction Obstructions for Connected Graph Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros, Micah J. Best","submitted_at":"2014-10-31T14:43:16Z","abstract_excerpt":"We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected (and monotone) mixed search number and we deal with the question whether the obstruction set, with respect of the contraction partial ordering, for those classes is finite. In general, there is no guarantee that those sets are finite, as graphs are not well quasi ordered under the contraction partial ordering relation.\n  In this paper we provide the obstruction set for $k=2$, where $k$ is the number of searchers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8756","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":""},"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-18T01:35:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3LTfdPo5SP6zTIF6X/Wrp0uv36PlZPcN4+jhKZAMhegDmhBp6II93Gundlhhv7t+ejAOh6OXv1+KXL1qIzkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:55:56.970003Z"},"content_sha256":"b46a63c469438401c1bc61d34fb2e37f1e2a49eab6f84cb674f9d8ca6e25e19f","schema_version":"1.0","event_id":"sha256:b46a63c469438401c1bc61d34fb2e37f1e2a49eab6f84cb674f9d8ca6e25e19f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/bundle.json","state_url":"https://pith.science/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/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-26T02:55:56Z","links":{"resolver":"https://pith.science/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6","bundle":"https://pith.science/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/bundle.json","state":"https://pith.science/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZU4DEQSHU23DMKK7BVH3H4WRV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZU4DEQSHU23DMKK7BVH3H4WRV6","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":"d86128ea74c5dad4441fba5d655ad6fe0377c8106b930ca3589f15f4bf956986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T14:43:16Z","title_canon_sha256":"d4ed3f6d4d2a926d2a5efbbf5b4aadc5b54e9d83b0d5368269733ea325924dd9"},"schema_version":"1.0","source":{"id":"1410.8756","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8756","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8756v3","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8756","created_at":"2026-05-18T01:35:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZU4DEQSHU23D","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZU4DEQSHU23DMKK7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZU4DEQSH","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:b46a63c469438401c1bc61d34fb2e37f1e2a49eab6f84cb674f9d8ca6e25e19f","target":"graph","created_at":"2026-05-18T01:35:32Z","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 connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected (and monotone) mixed search number and we deal with the question whether the obstruction set, with respect of the contraction partial ordering, for those classes is finite. In general, there is no guarantee that those sets are finite, as graphs are not well quasi ordered under the contraction partial ordering relation.\n  In this paper we provide the obstruction set for $k=2$, where $k$ is the number of searchers","authors_text":"Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros, Micah J. Best","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T14:43:16Z","title":"Contraction Obstructions for Connected Graph Searching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8756","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:3a6a5da5de6162a1e522a5c5431fce6b873ff4fa3082c9ef6f7277f7a6b380ba","target":"record","created_at":"2026-05-18T01:35:32Z","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":"d86128ea74c5dad4441fba5d655ad6fe0377c8106b930ca3589f15f4bf956986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T14:43:16Z","title_canon_sha256":"d4ed3f6d4d2a926d2a5efbbf5b4aadc5b54e9d83b0d5368269733ea325924dd9"},"schema_version":"1.0","source":{"id":"1410.8756","kind":"arxiv","version":3}},"canonical_sha256":"cd38324247a6b636295f0d4fb3f2d1af9125cc40d7d496c648f1cd98faee57a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd38324247a6b636295f0d4fb3f2d1af9125cc40d7d496c648f1cd98faee57a6","first_computed_at":"2026-05-18T01:35:32.728748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:32.728748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJmuvZfKgdQPtqDWkvSTfbWBk3ufAK6XcMjLwQvKCpMMI6hhfjUqVpVPd56C7Wli7d9bGEUpb40r9jDkgNMrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:32.729354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8756","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a6a5da5de6162a1e522a5c5431fce6b873ff4fa3082c9ef6f7277f7a6b380ba","sha256:b46a63c469438401c1bc61d34fb2e37f1e2a49eab6f84cb674f9d8ca6e25e19f"],"state_sha256":"d8ceaf67beb2751421a71c2e7fad40971df9d53821fb13d3aeb55656db0a6a59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5jO/mg1b8O3sZcWF19lDyNFSN54Pxogl/Q6AnmqORep1qXYAqIybRPU9PBTiyZiCjBq3x+Vpb7TFISTvBHLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:55:56.973733Z","bundle_sha256":"912cbeeb76816e8762c6db801607be7bb46579d1c81b11d67091688cc622dbab"}}