{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DG3DXRBDIHOPC267ZPVJFFLBEM","short_pith_number":"pith:DG3DXRBD","schema_version":"1.0","canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","source":{"kind":"arxiv","id":"1511.09262","version":1},"attestation_state":"computed","paper":{"title":"On independent $[1,2]$-sets in trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jose Caceres, Maria Luz Puertas, Sahar Aleid","submitted_at":"2015-11-30T12:04:52Z","abstract_excerpt":"An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an independent $[1,k]$-set have been characterized. In this paper we solve some problems previously posed by other authors about independent $[1,2]$-sets. We provide a necessary condition for a graph to have an independent $[1,2]$-set, in terms of spanning trees and we prove that this condition is also sufficient for cactus graphs. We follow the concept of excell"},"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":"1511.09262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T12:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"8d44638450c6cfa11555262eee3c4d5a7a23db569a5cc066724b444cb2b86843","abstract_canon_sha256":"18f140d73fb223c45c6965490796fc081b05d1ccf5a57c4ac0eae4a4c23b40f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:40.696964Z","signature_b64":"iykBBDqaRtA1sb08xpZH6sW2Fn8JxiSubEQgvoX1SsEFP5MDvc9OU+6MIpq5xN3Hb1xUlME6WVXsaZxrpDZtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","last_reissued_at":"2026-05-18T01:25:40.696296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:40.696296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On independent $[1,2]$-sets in trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jose Caceres, Maria Luz Puertas, Sahar Aleid","submitted_at":"2015-11-30T12:04:52Z","abstract_excerpt":"An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an independent $[1,k]$-set have been characterized. In this paper we solve some problems previously posed by other authors about independent $[1,2]$-sets. We provide a necessary condition for a graph to have an independent $[1,2]$-set, in terms of spanning trees and we prove that this condition is also sufficient for cactus graphs. We follow the concept of excell"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09262","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":"1511.09262","created_at":"2026-05-18T01:25:40.696409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.09262v1","created_at":"2026-05-18T01:25:40.696409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09262","created_at":"2026-05-18T01:25:40.696409+00:00"},{"alias_kind":"pith_short_12","alias_value":"DG3DXRBDIHOP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DG3DXRBDIHOPC267","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DG3DXRBD","created_at":"2026-05-18T12:29:17.054201+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/DG3DXRBDIHOPC267ZPVJFFLBEM","json":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM.json","graph_json":"https://pith.science/api/pith-number/DG3DXRBDIHOPC267ZPVJFFLBEM/graph.json","events_json":"https://pith.science/api/pith-number/DG3DXRBDIHOPC267ZPVJFFLBEM/events.json","paper":"https://pith.science/paper/DG3DXRBD"},"agent_actions":{"view_html":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM","download_json":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM.json","view_paper":"https://pith.science/paper/DG3DXRBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.09262&json=true","fetch_graph":"https://pith.science/api/pith-number/DG3DXRBDIHOPC267ZPVJFFLBEM/graph.json","fetch_events":"https://pith.science/api/pith-number/DG3DXRBDIHOPC267ZPVJFFLBEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/action/storage_attestation","attest_author":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/action/author_attestation","sign_citation":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/action/citation_signature","submit_replication":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/action/replication_record"}},"created_at":"2026-05-18T01:25:40.696409+00:00","updated_at":"2026-05-18T01:25:40.696409+00:00"}