{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FAFB2AG3EDNMDQDEOAFI2ZIFMU","short_pith_number":"pith:FAFB2AG3","canonical_record":{"source":{"id":"1812.05125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T19:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"9059c4d199fb043f329bc93c122b2efd6871f1e8112f68f867a52df33201ecf5","abstract_canon_sha256":"9f9c5222977cc0636b4974cf044f3c4d44dd7db6ba90d422bebbff75900fbc66"},"schema_version":"1.0"},"canonical_sha256":"280a1d00db20dac1c064700a8d6505653d4a02680e2400ee168f6907b5039a1b","source":{"kind":"arxiv","id":"1812.05125","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05125","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05125v2","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05125","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"FAFB2AG3EDNM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FAFB2AG3EDNMDQDE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FAFB2AG3","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FAFB2AG3EDNMDQDEOAFI2ZIFMU","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T19:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"9059c4d199fb043f329bc93c122b2efd6871f1e8112f68f867a52df33201ecf5","abstract_canon_sha256":"9f9c5222977cc0636b4974cf044f3c4d44dd7db6ba90d422bebbff75900fbc66"},"schema_version":"1.0"},"canonical_sha256":"280a1d00db20dac1c064700a8d6505653d4a02680e2400ee168f6907b5039a1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:27.114913Z","signature_b64":"C5XCClaJWzxb0AUgQGeqkktrWZQLCmswJBrAuMXNuVtEy8+Z3oecyDHp/xcNzeYgN0kdofQnVNzmDSW3a8L7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"280a1d00db20dac1c064700a8d6505653d4a02680e2400ee168f6907b5039a1b","last_reissued_at":"2026-05-17T23:47:27.114336Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:27.114336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05125","source_version":2,"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-17T23:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pjy8olQI5X2XVX9PfZLAcZTy3SIx6ClBjDmOw3eeT3X355qx0BUWBMPtOVZSoNQMsIyda3TBURhLU1ZcCSpOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:14.754538Z"},"content_sha256":"73ca392d9c81ad1319f9e55e47ecc631c91330df172782cafd6385c087a7c5e5","schema_version":"1.0","event_id":"sha256:73ca392d9c81ad1319f9e55e47ecc631c91330df172782cafd6385c087a7c5e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FAFB2AG3EDNMDQDEOAFI2ZIFMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number Coincide","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, Jasine Babu, J. Nandini Warrier, L. Sunil Chandran, Mathew Francis, Veena Prabhakaran","submitted_at":"2018-12-12T19:11:52Z","abstract_excerpt":"The eternal vertex cover problem is a variant of the classical vertex cover problem where a set of guards on the vertices have to be dynamically reconfigured from one vertex cover to another in every round of an attacker-defender game. The minimum number of guards required to protect a graph $G$ from an infinite sequence of attacks is the eternal vertex cover number of $G$, denoted by $evc(G)$. It is known that, given a graph $G$ and an integer $k$, checking whether $evc(G) \\le k$ is NP-hard. However, it is unknown whether this problem is in NP or not. Precise value of eternal vertex cover num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05125","kind":"arxiv","version":2},"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-17T23:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"652qz36JZphiO8IGVQYkkkapKP6SWzxvAFQHC4otuPMEVNd/2iB2c0QBKRyC1U2wZcWT+ZamWodJAIiQYrYZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:14.755242Z"},"content_sha256":"0a86adcb8fe91dc157aead59cda001664dbecd18a4be9d762ec295571d56fc18","schema_version":"1.0","event_id":"sha256:0a86adcb8fe91dc157aead59cda001664dbecd18a4be9d762ec295571d56fc18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/bundle.json","state_url":"https://pith.science/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/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-01T01:27:14Z","links":{"resolver":"https://pith.science/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU","bundle":"https://pith.science/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/bundle.json","state":"https://pith.science/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAFB2AG3EDNMDQDEOAFI2ZIFMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FAFB2AG3EDNMDQDEOAFI2ZIFMU","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":"9f9c5222977cc0636b4974cf044f3c4d44dd7db6ba90d422bebbff75900fbc66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T19:11:52Z","title_canon_sha256":"9059c4d199fb043f329bc93c122b2efd6871f1e8112f68f867a52df33201ecf5"},"schema_version":"1.0","source":{"id":"1812.05125","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05125","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05125v2","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05125","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"FAFB2AG3EDNM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FAFB2AG3EDNMDQDE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FAFB2AG3","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0a86adcb8fe91dc157aead59cda001664dbecd18a4be9d762ec295571d56fc18","target":"graph","created_at":"2026-05-17T23:47:27Z","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":"The eternal vertex cover problem is a variant of the classical vertex cover problem where a set of guards on the vertices have to be dynamically reconfigured from one vertex cover to another in every round of an attacker-defender game. The minimum number of guards required to protect a graph $G$ from an infinite sequence of attacks is the eternal vertex cover number of $G$, denoted by $evc(G)$. It is known that, given a graph $G$ and an integer $k$, checking whether $evc(G) \\le k$ is NP-hard. However, it is unknown whether this problem is in NP or not. Precise value of eternal vertex cover num","authors_text":"Deepak Rajendraprasad, Jasine Babu, J. Nandini Warrier, L. Sunil Chandran, Mathew Francis, Veena Prabhakaran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T19:11:52Z","title":"On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number Coincide"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05125","kind":"arxiv","version":2},"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:73ca392d9c81ad1319f9e55e47ecc631c91330df172782cafd6385c087a7c5e5","target":"record","created_at":"2026-05-17T23:47:27Z","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":"9f9c5222977cc0636b4974cf044f3c4d44dd7db6ba90d422bebbff75900fbc66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T19:11:52Z","title_canon_sha256":"9059c4d199fb043f329bc93c122b2efd6871f1e8112f68f867a52df33201ecf5"},"schema_version":"1.0","source":{"id":"1812.05125","kind":"arxiv","version":2}},"canonical_sha256":"280a1d00db20dac1c064700a8d6505653d4a02680e2400ee168f6907b5039a1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"280a1d00db20dac1c064700a8d6505653d4a02680e2400ee168f6907b5039a1b","first_computed_at":"2026-05-17T23:47:27.114336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:27.114336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C5XCClaJWzxb0AUgQGeqkktrWZQLCmswJBrAuMXNuVtEy8+Z3oecyDHp/xcNzeYgN0kdofQnVNzmDSW3a8L7Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:27.114913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05125","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73ca392d9c81ad1319f9e55e47ecc631c91330df172782cafd6385c087a7c5e5","sha256:0a86adcb8fe91dc157aead59cda001664dbecd18a4be9d762ec295571d56fc18"],"state_sha256":"ad416aac905ba27003819b474d30ccdbe39dd41ff66609ad1a1684a62967500d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNd9MvJg0sfXiOXoAuGgHzUSp3wRlXt2h6pGB2i46reGG4pDH2LoCphQfDLKR+XN7gnytIdTANaIGQJpMT2/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:27:14.759180Z","bundle_sha256":"102a9ac981bd1c60d8955454c00835f641a38f0e8abcab8e6a3833e2a441aedc"}}