{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OEJM3WOPREXX2SKH5JOIQMK3ND","short_pith_number":"pith:OEJM3WOP","canonical_record":{"source":{"id":"1503.04939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-17T07:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b080da7a67b26f14b07dc56a6559cfdaae8263652f645088866ab93ab64a92b8","abstract_canon_sha256":"ab39a08aec03cecc76429ef166d3a0c88474e2c4fb87e49a4970925dfef91a42"},"schema_version":"1.0"},"canonical_sha256":"7112cdd9cf892f7d4947ea5c88315b68e9eb8bfe83c4c7fb2454a118ab35500a","source":{"kind":"arxiv","id":"1503.04939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04939","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04939v1","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04939","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"OEJM3WOPREXX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OEJM3WOPREXX2SKH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OEJM3WOP","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OEJM3WOPREXX2SKH5JOIQMK3ND","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-17T07:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b080da7a67b26f14b07dc56a6559cfdaae8263652f645088866ab93ab64a92b8","abstract_canon_sha256":"ab39a08aec03cecc76429ef166d3a0c88474e2c4fb87e49a4970925dfef91a42"},"schema_version":"1.0"},"canonical_sha256":"7112cdd9cf892f7d4947ea5c88315b68e9eb8bfe83c4c7fb2454a118ab35500a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:21.044001Z","signature_b64":"WlUSVvAICzuK+i2UZTLL3/r50GGSjxLgNazXVUTpPb/I3loKG5Araa23y1Yc5jJHpxwDWWxSgMhKseHxwhqBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7112cdd9cf892f7d4947ea5c88315b68e9eb8bfe83c4c7fb2454a118ab35500a","last_reissued_at":"2026-05-18T02:22:21.043402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:21.043402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04939","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suRkBSWNNKju1VzmK1sxhJV3Ajz/XueUGEzRSFb/FcODTsXd4GLSqFOWrxSIXdi7Xt+RAvGYjhBeoe/EoR+5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:58:23.074149Z"},"content_sha256":"c6919e16edb43566ca6fe27c75b7f340df7ef322359c448312c7c293c448d531","schema_version":"1.0","event_id":"sha256:c6919e16edb43566ca6fe27c75b7f340df7ef322359c448312c7c293c448d531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OEJM3WOPREXX2SKH5JOIQMK3ND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total [1,2]-domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Xuezheng Lv","submitted_at":"2015-03-17T07:17:24Z","abstract_excerpt":"A subset $S\\subseteq V$ in a graph $G=(V,E)$ is a total $[1,2]$-set if, for every vertex $v\\in V$, $1\\leq |N(v)\\cap S|\\leq 2$. The minimum cardinality of a total $[1,2]$-set of $G$ is called the total $[1,2]$-domination number, denoted by $\\gamma_{t[1,2]}(G)$.\n  We establish two sharp upper bounds on the total [1,2]-domination number of a graph $G$ in terms of its order and minimum degree, and characterize the corresponding extremal graphs achieving these bounds. Moreover, we give some sufficient conditions for a graph without total $[1,2]$-set and for a graph with the same total $[1,2]$-domin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04939","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HJmeej8SOfU+ywDKBjhxKLq0a0iY0A97x9KYFkzAMFuTlI/zh6llh987CTugNGmHBnJfiq3fKzX4Q+6yBRCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:58:23.074505Z"},"content_sha256":"c1379c7cb2e90bc0e9505e6ae88805b4f030c6927d4a37a6be03ac6ba831d365","schema_version":"1.0","event_id":"sha256:c1379c7cb2e90bc0e9505e6ae88805b4f030c6927d4a37a6be03ac6ba831d365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/bundle.json","state_url":"https://pith.science/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/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-02T18:58:23Z","links":{"resolver":"https://pith.science/pith/OEJM3WOPREXX2SKH5JOIQMK3ND","bundle":"https://pith.science/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/bundle.json","state":"https://pith.science/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEJM3WOPREXX2SKH5JOIQMK3ND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OEJM3WOPREXX2SKH5JOIQMK3ND","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":"ab39a08aec03cecc76429ef166d3a0c88474e2c4fb87e49a4970925dfef91a42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-17T07:17:24Z","title_canon_sha256":"b080da7a67b26f14b07dc56a6559cfdaae8263652f645088866ab93ab64a92b8"},"schema_version":"1.0","source":{"id":"1503.04939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04939","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04939v1","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04939","created_at":"2026-05-18T02:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"OEJM3WOPREXX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OEJM3WOPREXX2SKH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OEJM3WOP","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:c1379c7cb2e90bc0e9505e6ae88805b4f030c6927d4a37a6be03ac6ba831d365","target":"graph","created_at":"2026-05-18T02:22:21Z","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 total $[1,2]$-set if, for every vertex $v\\in V$, $1\\leq |N(v)\\cap S|\\leq 2$. The minimum cardinality of a total $[1,2]$-set of $G$ is called the total $[1,2]$-domination number, denoted by $\\gamma_{t[1,2]}(G)$.\n  We establish two sharp upper bounds on the total [1,2]-domination number of a graph $G$ in terms of its order and minimum degree, and characterize the corresponding extremal graphs achieving these bounds. Moreover, we give some sufficient conditions for a graph without total $[1,2]$-set and for a graph with the same total $[1,2]$-domin","authors_text":"Baoyindureng Wu, Xuezheng Lv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-17T07:17:24Z","title":"Total [1,2]-domination in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04939","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:c6919e16edb43566ca6fe27c75b7f340df7ef322359c448312c7c293c448d531","target":"record","created_at":"2026-05-18T02:22:21Z","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":"ab39a08aec03cecc76429ef166d3a0c88474e2c4fb87e49a4970925dfef91a42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-17T07:17:24Z","title_canon_sha256":"b080da7a67b26f14b07dc56a6559cfdaae8263652f645088866ab93ab64a92b8"},"schema_version":"1.0","source":{"id":"1503.04939","kind":"arxiv","version":1}},"canonical_sha256":"7112cdd9cf892f7d4947ea5c88315b68e9eb8bfe83c4c7fb2454a118ab35500a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7112cdd9cf892f7d4947ea5c88315b68e9eb8bfe83c4c7fb2454a118ab35500a","first_computed_at":"2026-05-18T02:22:21.043402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:21.043402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlUSVvAICzuK+i2UZTLL3/r50GGSjxLgNazXVUTpPb/I3loKG5Araa23y1Yc5jJHpxwDWWxSgMhKseHxwhqBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:21.044001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6919e16edb43566ca6fe27c75b7f340df7ef322359c448312c7c293c448d531","sha256:c1379c7cb2e90bc0e9505e6ae88805b4f030c6927d4a37a6be03ac6ba831d365"],"state_sha256":"0f0bf55e95ac515cf11fd10fe2ae73ff74fa6f439d9ea13c71c4babddf16c04b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJT+1ccFnK7/0O1vydNvJcK7CgoGk5Er22eUlXiH4/uTHCQUIUh2m1BpbQ9WOFlYkklIiWLmHr9i/2MOwnElCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:58:23.077414Z","bundle_sha256":"a1e3c6984ccd6f0e5804a1c7df28752a359aafa53378e3d60920768a3571a24b"}}