{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DG3DXRBDIHOPC267ZPVJFFLBEM","short_pith_number":"pith:DG3DXRBD","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"},"canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","source":{"kind":"arxiv","id":"1511.09262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09262","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09262v1","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09262","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"DG3DXRBDIHOP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DG3DXRBDIHOPC267","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DG3DXRBD","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DG3DXRBDIHOPC267ZPVJFFLBEM","target":"record","payload":{"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"},"canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","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"},"source_kind":"arxiv","source_id":"1511.09262","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-18T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdyvU6014rmW60Wd/AiEt7iTv5Pnl83iRsyK1dwFYEBSHBYUKZ9rGjy4lzS6XFrre+lhMwrIGTou7LwkHLkbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:16.508175Z"},"content_sha256":"b00d1859555655421f060e377ecf25a6c6b7af89bae5d1d704bfe8eeec0a5536","schema_version":"1.0","event_id":"sha256:b00d1859555655421f060e377ecf25a6c6b7af89bae5d1d704bfe8eeec0a5536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DG3DXRBDIHOPC267ZPVJFFLBEM","target":"graph","payload":{"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"},"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-18T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptn9jpJ5y/ZxY9YyN1tgm0iZuHpI4JBb1JkRPUeeOhP4IqP90OaRkWxcuR+qD3kzTkj2eljNufGXp1k5ntHKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:16.508537Z"},"content_sha256":"1169bce812590d38f4186d3c4207e5128377559b85b0aad1c6c09ebbb8d9f812","schema_version":"1.0","event_id":"sha256:1169bce812590d38f4186d3c4207e5128377559b85b0aad1c6c09ebbb8d9f812"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/bundle.json","state_url":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/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-24T23:09:16Z","links":{"resolver":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM","bundle":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/bundle.json","state":"https://pith.science/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DG3DXRBDIHOPC267ZPVJFFLBEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DG3DXRBDIHOPC267ZPVJFFLBEM","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":"18f140d73fb223c45c6965490796fc081b05d1ccf5a57c4ac0eae4a4c23b40f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T12:04:52Z","title_canon_sha256":"8d44638450c6cfa11555262eee3c4d5a7a23db569a5cc066724b444cb2b86843"},"schema_version":"1.0","source":{"id":"1511.09262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09262","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09262v1","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09262","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"DG3DXRBDIHOP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DG3DXRBDIHOPC267","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DG3DXRBD","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:1169bce812590d38f4186d3c4207e5128377559b85b0aad1c6c09ebbb8d9f812","target":"graph","created_at":"2026-05-18T01:25:40Z","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":"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","authors_text":"Jose Caceres, Maria Luz Puertas, Sahar Aleid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T12:04:52Z","title":"On independent $[1,2]$-sets in trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09262","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:b00d1859555655421f060e377ecf25a6c6b7af89bae5d1d704bfe8eeec0a5536","target":"record","created_at":"2026-05-18T01:25:40Z","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":"18f140d73fb223c45c6965490796fc081b05d1ccf5a57c4ac0eae4a4c23b40f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T12:04:52Z","title_canon_sha256":"8d44638450c6cfa11555262eee3c4d5a7a23db569a5cc066724b444cb2b86843"},"schema_version":"1.0","source":{"id":"1511.09262","kind":"arxiv","version":1}},"canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19b63bc42341dcf16bdfcbea9295612302b0d77d8f7bc10e57273d0be51d7de5","first_computed_at":"2026-05-18T01:25:40.696296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:40.696296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iykBBDqaRtA1sb08xpZH6sW2Fn8JxiSubEQgvoX1SsEFP5MDvc9OU+6MIpq5xN3Hb1xUlME6WVXsaZxrpDZtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:40.696964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.09262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b00d1859555655421f060e377ecf25a6c6b7af89bae5d1d704bfe8eeec0a5536","sha256:1169bce812590d38f4186d3c4207e5128377559b85b0aad1c6c09ebbb8d9f812"],"state_sha256":"ef96b3967912c262b4a581069374dadc7e57c412b58eac8ac4ad2ef6ab73a369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEqq/oSxEJPVH/JOVDmiB6RFVdf0FKS2Pmoi+SzDjklhYJq+psxeBjRWtgi5dHj9zw7Ut/bF0arKjEJUZZY4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:09:16.510790Z","bundle_sha256":"4073ad042f23fca93311e5927d2f7fff9d3e03bba700c109417e6407b1fc6a95"}}