{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BOAMLW6FYZWSS6YSYI2TPNWJY2","short_pith_number":"pith:BOAMLW6F","canonical_record":{"source":{"id":"1602.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T18:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e5e33e3035148b1632cfecfc92a9721c06b5142faaccd81386b17aba9d23389","abstract_canon_sha256":"4a555b25d622d098a07464c512740ca62879929059b09633223e9bee3558fef4"},"schema_version":"1.0"},"canonical_sha256":"0b80c5dbc5c66d297b12c23537b6c9c68043a7af9cef8f67389753aca55f617a","source":{"kind":"arxiv","id":"1602.05136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05136","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05136v1","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05136","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOAMLW6FYZWS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BOAMLW6FYZWSS6YS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BOAMLW6F","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BOAMLW6FYZWSS6YSYI2TPNWJY2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T18:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e5e33e3035148b1632cfecfc92a9721c06b5142faaccd81386b17aba9d23389","abstract_canon_sha256":"4a555b25d622d098a07464c512740ca62879929059b09633223e9bee3558fef4"},"schema_version":"1.0"},"canonical_sha256":"0b80c5dbc5c66d297b12c23537b6c9c68043a7af9cef8f67389753aca55f617a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:30.726245Z","signature_b64":"PkDLXp6ifUj0c911VXLKXm7cwJPZWJlIpFX4nP0yxXxBJUkX0lLEWBjnjIhN++Legq5qfXO3Lcsl5gP663C/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b80c5dbc5c66d297b12c23537b6c9c68043a7af9cef8f67389753aca55f617a","last_reissued_at":"2026-05-18T01:03:30.725637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:30.725637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05136","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-18T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ze+YuO/VBaMvzC4WH/WmKi9RoiQ4O1bt82okPyGXkXP8asRs2zXsudFibH1H7vXPW+l+mcau4LIz1wooxYeYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:36:57.447572Z"},"content_sha256":"7d6dcf5b68354800e8a8902fd2715678773149b332ddbb0ce0a126e6d2162892","schema_version":"1.0","event_id":"sha256:7d6dcf5b68354800e8a8902fd2715678773149b332ddbb0ce0a126e6d2162892"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BOAMLW6FYZWSS6YSYI2TPNWJY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploration of Faulty Hamiltonian Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, David Caissy","submitted_at":"2016-02-16T18:50:51Z","abstract_excerpt":"We consider the problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explore the connected fault-free component of this node by visiting all of its nodes. The cost of the exploration is the number of edge traversals. For a given network and given starting node, the overhead of an exploration algorithm is the worst-case ratio (taken over all fault configurations) of its cost to the cost of an optimal algorithm which knows where faults are situated. An exploration algorithm, for a given netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05136","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-18T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXevFW2xeplxxzKdIxqhVRCUf1vokOH2fJ3d/URVF7OYguPcWtrOtOYWeDGim7mGEyuInvDGA77lRQZuu4QvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:36:57.448181Z"},"content_sha256":"685f0b795f2d6c04652a1182018c74da49ad7b348c8c7b378ca8fb0463142bd9","schema_version":"1.0","event_id":"sha256:685f0b795f2d6c04652a1182018c74da49ad7b348c8c7b378ca8fb0463142bd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/bundle.json","state_url":"https://pith.science/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/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-06-26T09:36:57Z","links":{"resolver":"https://pith.science/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2","bundle":"https://pith.science/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/bundle.json","state":"https://pith.science/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOAMLW6FYZWSS6YSYI2TPNWJY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BOAMLW6FYZWSS6YSYI2TPNWJY2","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":"4a555b25d622d098a07464c512740ca62879929059b09633223e9bee3558fef4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T18:50:51Z","title_canon_sha256":"0e5e33e3035148b1632cfecfc92a9721c06b5142faaccd81386b17aba9d23389"},"schema_version":"1.0","source":{"id":"1602.05136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05136","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05136v1","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05136","created_at":"2026-05-18T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOAMLW6FYZWS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BOAMLW6FYZWSS6YS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BOAMLW6F","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:685f0b795f2d6c04652a1182018c74da49ad7b348c8c7b378ca8fb0463142bd9","target":"graph","created_at":"2026-05-18T01:03:30Z","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 problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explore the connected fault-free component of this node by visiting all of its nodes. The cost of the exploration is the number of edge traversals. For a given network and given starting node, the overhead of an exploration algorithm is the worst-case ratio (taken over all fault configurations) of its cost to the cost of an optimal algorithm which knows where faults are situated. An exploration algorithm, for a given netwo","authors_text":"Andrzej Pelc, David Caissy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T18:50:51Z","title":"Exploration of Faulty Hamiltonian Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05136","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:7d6dcf5b68354800e8a8902fd2715678773149b332ddbb0ce0a126e6d2162892","target":"record","created_at":"2026-05-18T01:03:30Z","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":"4a555b25d622d098a07464c512740ca62879929059b09633223e9bee3558fef4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T18:50:51Z","title_canon_sha256":"0e5e33e3035148b1632cfecfc92a9721c06b5142faaccd81386b17aba9d23389"},"schema_version":"1.0","source":{"id":"1602.05136","kind":"arxiv","version":1}},"canonical_sha256":"0b80c5dbc5c66d297b12c23537b6c9c68043a7af9cef8f67389753aca55f617a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b80c5dbc5c66d297b12c23537b6c9c68043a7af9cef8f67389753aca55f617a","first_computed_at":"2026-05-18T01:03:30.725637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:30.725637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkDLXp6ifUj0c911VXLKXm7cwJPZWJlIpFX4nP0yxXxBJUkX0lLEWBjnjIhN++Legq5qfXO3Lcsl5gP663C/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:30.726245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d6dcf5b68354800e8a8902fd2715678773149b332ddbb0ce0a126e6d2162892","sha256:685f0b795f2d6c04652a1182018c74da49ad7b348c8c7b378ca8fb0463142bd9"],"state_sha256":"55f59ce4f7beda7d971c920abff6df0fd304f62bd01b5ee656751f6a5dbb09c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3SmiiU/A874evJYPNXQ/w+sFOcbzTzVz4KF/eDH/d0vsKhY2sF2bxM6+jriq0wTXy34Lp+dlzS39uGtLQiyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:36:57.451019Z","bundle_sha256":"13e98f507f0ed93c92aba9240352146c0c447cd382e0e4b63a0bd6ecf7e154eb"}}