{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XB6CMCAT7BYVJQQ2IAFKQLA57F","short_pith_number":"pith:XB6CMCAT","schema_version":"1.0","canonical_sha256":"b87c260813f87154c21a400aa82c1df95730dab2a4206597e217fae7a279e392","source":{"kind":"arxiv","id":"1505.07967","version":1},"attestation_state":"computed","paper":{"title":"Perfect and quasiperfect domination in trees","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":"2015-05-29T09:30:39Z","abstract_excerpt":"A $k-$quasiperfect dominating set ($k\\ge 1$) of a graph $G$ is a vertex subset $S$ such that 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. The quasiperfect domination chain $\\gamma_{\\stackrel{}{11}}(G)\\ge\\gamma_{\\stackrel{}{12}}(G)\\ge\\dots\\ge\\gamma_{\\stackrel{}{1\\Delta}}(G)=\\gamma(G)$, indicates what it is lost in size when you move tow"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.07967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T09:30:39Z","cross_cats_sorted":[],"title_canon_sha256":"f2ac82887b7ece48e692d33e101fde0fa44a51ee9bdd40137f04f3444870fde7","abstract_canon_sha256":"9ca2162150e7c9f915fde47415effca8fa100440f663f3e9cb4d124866424dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:00.159672Z","signature_b64":"JlIeuSyx8jn2UUdW0F7wB8zcZswVjekXOIrlbtmBnCXJDZ/3got6uR3Mb1jh9mvW4k+ej13aSCpsuEbk4aHKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87c260813f87154c21a400aa82c1df95730dab2a4206597e217fae7a279e392","last_reissued_at":"2026-05-18T02:00:00.159150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:00.159150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect and quasiperfect domination in trees","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":"2015-05-29T09:30:39Z","abstract_excerpt":"A $k-$quasiperfect dominating set ($k\\ge 1$) of a graph $G$ is a vertex subset $S$ such that 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. The quasiperfect domination chain $\\gamma_{\\stackrel{}{11}}(G)\\ge\\gamma_{\\stackrel{}{12}}(G)\\ge\\dots\\ge\\gamma_{\\stackrel{}{1\\Delta}}(G)=\\gamma(G)$, indicates what it is lost in size when you move tow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07967","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.07967","created_at":"2026-05-18T02:00:00.159234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07967v1","created_at":"2026-05-18T02:00:00.159234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07967","created_at":"2026-05-18T02:00:00.159234+00:00"},{"alias_kind":"pith_short_12","alias_value":"XB6CMCAT7BYV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XB6CMCAT7BYVJQQ2","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XB6CMCAT","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F","json":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F.json","graph_json":"https://pith.science/api/pith-number/XB6CMCAT7BYVJQQ2IAFKQLA57F/graph.json","events_json":"https://pith.science/api/pith-number/XB6CMCAT7BYVJQQ2IAFKQLA57F/events.json","paper":"https://pith.science/paper/XB6CMCAT"},"agent_actions":{"view_html":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F","download_json":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F.json","view_paper":"https://pith.science/paper/XB6CMCAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07967&json=true","fetch_graph":"https://pith.science/api/pith-number/XB6CMCAT7BYVJQQ2IAFKQLA57F/graph.json","fetch_events":"https://pith.science/api/pith-number/XB6CMCAT7BYVJQQ2IAFKQLA57F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F/action/storage_attestation","attest_author":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F/action/author_attestation","sign_citation":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F/action/citation_signature","submit_replication":"https://pith.science/pith/XB6CMCAT7BYVJQQ2IAFKQLA57F/action/replication_record"}},"created_at":"2026-05-18T02:00:00.159234+00:00","updated_at":"2026-05-18T02:00:00.159234+00:00"}