{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WGB354BMFAAH6DLCJQG7KBVKYH","short_pith_number":"pith:WGB354BM","canonical_record":{"source":{"id":"1411.7818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T11:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"d63f5639c589dd245ee60c1d2b7479f5bb554dc2e244d76b064ff7760bd9da41","abstract_canon_sha256":"8275d75993392d07c558125d0d2784a7f4387b3b7a6d14d3e66c06ceeaa95fc6"},"schema_version":"1.0"},"canonical_sha256":"b183bef02c28007f0d624c0df506aac1cc264058ad3464ab7a1cad081b846e83","source":{"kind":"arxiv","id":"1411.7818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7818","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7818v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7818","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"WGB354BMFAAH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WGB354BMFAAH6DLC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WGB354BM","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WGB354BMFAAH6DLCJQG7KBVKYH","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T11:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"d63f5639c589dd245ee60c1d2b7479f5bb554dc2e244d76b064ff7760bd9da41","abstract_canon_sha256":"8275d75993392d07c558125d0d2784a7f4387b3b7a6d14d3e66c06ceeaa95fc6"},"schema_version":"1.0"},"canonical_sha256":"b183bef02c28007f0d624c0df506aac1cc264058ad3464ab7a1cad081b846e83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:37.186173Z","signature_b64":"W9Vw58ld35ZM9rhYeP8LSyijz273sLJ2Bu2AuMvEJxkHQE+2YyC73BqyGepYUgvY3ZJNgq5QbUxtNqwG1lSYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b183bef02c28007f0d624c0df506aac1cc264058ad3464ab7a1cad081b846e83","last_reissued_at":"2026-05-18T02:32:37.185754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:37.185754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7818","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-18T02:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knCshwhS46uuCOTL6a9nco4q2s700x3OG8tPhqLKLQuEmg8kh8X+/CcYwebr92JhQAjQThyFPocG+55NvI04DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:29:07.859920Z"},"content_sha256":"ee69db60054e75400c1ba51c1769c4b7e404ba2dd40050a3df706681636ec463","schema_version":"1.0","event_id":"sha256:ee69db60054e75400c1ba51c1769c4b7e404ba2dd40050a3df706681636ec463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WGB354BMFAAH6DLCJQG7KBVKYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Perfect and Quasiperfect Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Jos\\'e C\\'aceres, Mar\\'ia Luz Puertas, Merc\\`e Mora","submitted_at":"2014-11-28T11:21:32Z","abstract_excerpt":"A subset $S\\subseteq V$ in a graph $G=(V,E)$ is a $k$-quasiperfect dominating set (for $k\\geq 1$) if every vertex not in $S$ is adjacent to at least one and at most $k$ vertices in $S$. The cardinality of a minimum $k$-quasiperfect dominating set in $G$ is denoted by $\\gamma_ {\\stackrel{}{1k}}(G)$. Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a decreasing chain of quasiperfect dominating numbers $ n \\ge \\gamma_ {\\stackrel{}{11}}(G) \\ge \\gamma_ {\\stackrel{}{12}}(G)\\ge \\ldots \\ge \\gamma_ {\\stackrel{}{1\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7818","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-18T02:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4o9H3RYjRf85wESpoj4VXtKnSAX4SBffav1H7Pnwa5s3ViewGHSp7Uoobr8Oj9WaokjkpfJr9ALNdmEE280Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:29:07.860646Z"},"content_sha256":"a49a747e91df41cd52a955840572edf32d1c0b5d80bcfd0fac88fa42bc8771ee","schema_version":"1.0","event_id":"sha256:a49a747e91df41cd52a955840572edf32d1c0b5d80bcfd0fac88fa42bc8771ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGB354BMFAAH6DLCJQG7KBVKYH/bundle.json","state_url":"https://pith.science/pith/WGB354BMFAAH6DLCJQG7KBVKYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGB354BMFAAH6DLCJQG7KBVKYH/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-08T01:29:07Z","links":{"resolver":"https://pith.science/pith/WGB354BMFAAH6DLCJQG7KBVKYH","bundle":"https://pith.science/pith/WGB354BMFAAH6DLCJQG7KBVKYH/bundle.json","state":"https://pith.science/pith/WGB354BMFAAH6DLCJQG7KBVKYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGB354BMFAAH6DLCJQG7KBVKYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WGB354BMFAAH6DLCJQG7KBVKYH","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":"8275d75993392d07c558125d0d2784a7f4387b3b7a6d14d3e66c06ceeaa95fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T11:21:32Z","title_canon_sha256":"d63f5639c589dd245ee60c1d2b7479f5bb554dc2e244d76b064ff7760bd9da41"},"schema_version":"1.0","source":{"id":"1411.7818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7818","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7818v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7818","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"WGB354BMFAAH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WGB354BMFAAH6DLC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WGB354BM","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:a49a747e91df41cd52a955840572edf32d1c0b5d80bcfd0fac88fa42bc8771ee","target":"graph","created_at":"2026-05-18T02:32:37Z","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":"A subset $S\\subseteq V$ in a graph $G=(V,E)$ is a $k$-quasiperfect dominating set (for $k\\geq 1$) if every vertex not in $S$ is adjacent to at least one and at most $k$ vertices in $S$. The cardinality of a minimum $k$-quasiperfect dominating set in $G$ is denoted by $\\gamma_ {\\stackrel{}{1k}}(G)$. Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a decreasing chain of quasiperfect dominating numbers $ n \\ge \\gamma_ {\\stackrel{}{11}}(G) \\ge \\gamma_ {\\stackrel{}{12}}(G)\\ge \\ldots \\ge \\gamma_ {\\stackrel{}{1\\","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Jos\\'e C\\'aceres, Mar\\'ia Luz Puertas, Merc\\`e Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T11:21:32Z","title":"On Perfect and Quasiperfect Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7818","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:ee69db60054e75400c1ba51c1769c4b7e404ba2dd40050a3df706681636ec463","target":"record","created_at":"2026-05-18T02:32:37Z","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":"8275d75993392d07c558125d0d2784a7f4387b3b7a6d14d3e66c06ceeaa95fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T11:21:32Z","title_canon_sha256":"d63f5639c589dd245ee60c1d2b7479f5bb554dc2e244d76b064ff7760bd9da41"},"schema_version":"1.0","source":{"id":"1411.7818","kind":"arxiv","version":1}},"canonical_sha256":"b183bef02c28007f0d624c0df506aac1cc264058ad3464ab7a1cad081b846e83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b183bef02c28007f0d624c0df506aac1cc264058ad3464ab7a1cad081b846e83","first_computed_at":"2026-05-18T02:32:37.185754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:37.185754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9Vw58ld35ZM9rhYeP8LSyijz273sLJ2Bu2AuMvEJxkHQE+2YyC73BqyGepYUgvY3ZJNgq5QbUxtNqwG1lSYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:37.186173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee69db60054e75400c1ba51c1769c4b7e404ba2dd40050a3df706681636ec463","sha256:a49a747e91df41cd52a955840572edf32d1c0b5d80bcfd0fac88fa42bc8771ee"],"state_sha256":"9c262383e88e24ba81d9faae6a7685143bd3ddd9319b3b3d47091c7f9c7f3fb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQRyvTI33KmwtW75VqF/topFBfR+EgvEm9xTr8hJTp8pZrUF+k8KNNQNTYVKfvb+48KAnK3plK1wNWYLtWFlDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:29:07.865090Z","bundle_sha256":"954e3ce122f97abd464dd8c1527a7a7e89388ed5fcf285aab97e14d57b449787"}}