{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:437S3Z7QK3SYAGCZ6V32PS2UYX","short_pith_number":"pith:437S3Z7Q","canonical_record":{"source":{"id":"1008.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-19T04:17:46Z","cross_cats_sorted":[],"title_canon_sha256":"de43013f0573c5ca213525c32e4f1fa90b5bcf4609fd5590e02551550ef52c86","abstract_canon_sha256":"4d2a7d4fece69b055488c61254a9b06817094c7239f86cff679b8776e363e625"},"schema_version":"1.0"},"canonical_sha256":"e6ff2de7f056e5801859f577a7cb54c5f80e329a9b624d7089e325512f981c66","source":{"kind":"arxiv","id":"1008.3208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3208","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3208v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3208","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"437S3Z7QK3SY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"437S3Z7QK3SYAGCZ","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"437S3Z7Q","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:437S3Z7QK3SYAGCZ6V32PS2UYX","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-19T04:17:46Z","cross_cats_sorted":[],"title_canon_sha256":"de43013f0573c5ca213525c32e4f1fa90b5bcf4609fd5590e02551550ef52c86","abstract_canon_sha256":"4d2a7d4fece69b055488c61254a9b06817094c7239f86cff679b8776e363e625"},"schema_version":"1.0"},"canonical_sha256":"e6ff2de7f056e5801859f577a7cb54c5f80e329a9b624d7089e325512f981c66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.129953Z","signature_b64":"DRw4y06hbrOyL1g8ZSgar9FctyXnKDbnKQKqVabBbRmsFXGyG8uAgs/WZDxl5AbJbOnqg5CQa4huqWFxtf06CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6ff2de7f056e5801859f577a7cb54c5f80e329a9b624d7089e325512f981c66","last_reissued_at":"2026-05-18T04:42:03.129477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.129477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3208","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Uuoxx05oC+iYVMSVkJdKkAMtkMLNOGyyqzkUrNXYHE9VH7mIxrJeezpt6icbcxWVoLqS9EsZyCoGdes6Op3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:45:29.561270Z"},"content_sha256":"a1b722ab3d3298cbb1628d7a52e9ec0a3256729dd375218118aa0418cc9640af","schema_version":"1.0","event_id":"sha256:a1b722ab3d3298cbb1628d7a52e9ec0a3256729dd375218118aa0418cc9640af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:437S3Z7QK3SYAGCZ6V32PS2UYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On minimum vertex cover of generalized Petersen graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Babak Behsaz, Ebadollah S. Mahmoodian, Pooya Hatami","submitted_at":"2010-08-19T04:17:46Z","abstract_excerpt":"For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph $P(n,k)$, is defined by vertex set $\\lbrace u_i,v_i\\rbrace$ and edge set $\\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\\rbrace$; where $i = 1,2,\\dots,n$ and subscripts are reduced modulo $n$. Here first, we characterize minimum vertex covers in generalized Petersen graphs. Second, we present a lower bound and some upper bounds for $\\beta(P(n,k))$, the size of minimum vertex cover of $P(n,k)$. Third, in some cases, we determine the exact values of $\\beta(P(n,k))$. Our conjecture is that $\\beta(P(n,k)) \\le n + \\lceil\\frac{n}{5}\\rcei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3208","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yA6Qgt8b8/f+mzOHnn8FK2YwsNQB/tvZuiz2Q5j3FPRXSX5iLitleK+HQXlvMf4bFPoLDExcuGhY5A3fPqjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:45:29.561627Z"},"content_sha256":"6bf9759c54c46edd21e54174fe6f9a7f944dbc601c8fc4a65157ede2c53e712e","schema_version":"1.0","event_id":"sha256:6bf9759c54c46edd21e54174fe6f9a7f944dbc601c8fc4a65157ede2c53e712e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/bundle.json","state_url":"https://pith.science/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/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-04T01:45:29Z","links":{"resolver":"https://pith.science/pith/437S3Z7QK3SYAGCZ6V32PS2UYX","bundle":"https://pith.science/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/bundle.json","state":"https://pith.science/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/437S3Z7QK3SYAGCZ6V32PS2UYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:437S3Z7QK3SYAGCZ6V32PS2UYX","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":"4d2a7d4fece69b055488c61254a9b06817094c7239f86cff679b8776e363e625","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-19T04:17:46Z","title_canon_sha256":"de43013f0573c5ca213525c32e4f1fa90b5bcf4609fd5590e02551550ef52c86"},"schema_version":"1.0","source":{"id":"1008.3208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3208","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3208v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3208","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"437S3Z7QK3SY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"437S3Z7QK3SYAGCZ","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"437S3Z7Q","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:6bf9759c54c46edd21e54174fe6f9a7f944dbc601c8fc4a65157ede2c53e712e","target":"graph","created_at":"2026-05-18T04:42:03Z","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":"For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph $P(n,k)$, is defined by vertex set $\\lbrace u_i,v_i\\rbrace$ and edge set $\\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\\rbrace$; where $i = 1,2,\\dots,n$ and subscripts are reduced modulo $n$. Here first, we characterize minimum vertex covers in generalized Petersen graphs. Second, we present a lower bound and some upper bounds for $\\beta(P(n,k))$, the size of minimum vertex cover of $P(n,k)$. Third, in some cases, we determine the exact values of $\\beta(P(n,k))$. Our conjecture is that $\\beta(P(n,k)) \\le n + \\lceil\\frac{n}{5}\\rcei","authors_text":"Babak Behsaz, Ebadollah S. Mahmoodian, Pooya Hatami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-19T04:17:46Z","title":"On minimum vertex cover of generalized Petersen graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3208","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:a1b722ab3d3298cbb1628d7a52e9ec0a3256729dd375218118aa0418cc9640af","target":"record","created_at":"2026-05-18T04:42:03Z","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":"4d2a7d4fece69b055488c61254a9b06817094c7239f86cff679b8776e363e625","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-19T04:17:46Z","title_canon_sha256":"de43013f0573c5ca213525c32e4f1fa90b5bcf4609fd5590e02551550ef52c86"},"schema_version":"1.0","source":{"id":"1008.3208","kind":"arxiv","version":1}},"canonical_sha256":"e6ff2de7f056e5801859f577a7cb54c5f80e329a9b624d7089e325512f981c66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6ff2de7f056e5801859f577a7cb54c5f80e329a9b624d7089e325512f981c66","first_computed_at":"2026-05-18T04:42:03.129477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.129477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRw4y06hbrOyL1g8ZSgar9FctyXnKDbnKQKqVabBbRmsFXGyG8uAgs/WZDxl5AbJbOnqg5CQa4huqWFxtf06CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.129953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1b722ab3d3298cbb1628d7a52e9ec0a3256729dd375218118aa0418cc9640af","sha256:6bf9759c54c46edd21e54174fe6f9a7f944dbc601c8fc4a65157ede2c53e712e"],"state_sha256":"462a897f89fb5c7bcaf465ad80fca8ec917c8954fbdac76465bcade0fceb561c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEyz0qQA2TqVwzYNlR2ugdgbtiwtD7KDbSnSKUq1sNqjWq9wTTYc1diivGRVbTvNwfjXK9ZizdVl8KCGSRiLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:45:29.563471Z","bundle_sha256":"fd1b193671863c85751d7948a426c4582b8972372a1ae24661ddefffd32aeed8"}}