{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7VBZMTYT2RLBIJHDRKQBNFDOWV","short_pith_number":"pith:7VBZMTYT","canonical_record":{"source":{"id":"1803.04031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T20:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"14e67526e97d614983137b21530cc2a99eeeb0259e409a37b6b57f8b012696cd","abstract_canon_sha256":"dffe14f11443ffe580ac8a5e025a94e7952f25071424d3248848de8855452692"},"schema_version":"1.0"},"canonical_sha256":"fd43964f13d4561424e38aa016946eb55650467370899f5ce54e1dfbaded8465","source":{"kind":"arxiv","id":"1803.04031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04031","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04031v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04031","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"7VBZMTYT2RLB","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7VBZMTYT2RLBIJHD","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7VBZMTYT","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7VBZMTYT2RLBIJHDRKQBNFDOWV","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T20:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"14e67526e97d614983137b21530cc2a99eeeb0259e409a37b6b57f8b012696cd","abstract_canon_sha256":"dffe14f11443ffe580ac8a5e025a94e7952f25071424d3248848de8855452692"},"schema_version":"1.0"},"canonical_sha256":"fd43964f13d4561424e38aa016946eb55650467370899f5ce54e1dfbaded8465","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:33.147769Z","signature_b64":"QuxphhOicZLRy9/UA5KHv+IqAvkxTXhU4XTzm2Amw4oMWN0GuVTpZRep7dl5lFmsQ3x8jvnT2HGiK0HbAGY/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd43964f13d4561424e38aa016946eb55650467370899f5ce54e1dfbaded8465","last_reissued_at":"2026-05-18T00:21:33.147115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:33.147115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04031","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-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1V+LArjbHX0CjszErHuxMQBvOrcDAsB5u7o6BbDTla5A3iuliu1ev31+byH4Z6rA+fgvGL7SiDptxuFDj7iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:20.552847Z"},"content_sha256":"ce87e62950d37cb3541409cc565b59c4b5f7bc9cbe9292ac1f4605c6e2818d05","schema_version":"1.0","event_id":"sha256:ce87e62950d37cb3541409cc565b59c4b5f7bc9cbe9292ac1f4605c6e2818d05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7VBZMTYT2RLBIJHDRKQBNFDOWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds for domination numbers of graphs using Tur\\'an's Theorem and Lov\\'asz local lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Jafari, Sharareh Alipour","submitted_at":"2018-03-11T20:10:07Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with vertex set $V(G)$. A subset $S\\subseteq V(G)$ is an $(a,b)$-dominating set if every vertex $v\\in S$ is adjacent to at least $a$ vertices in $S$ and every $v\\in V\\setminus S$ is adjacent to at least $b$ vertices in $S$. The minimum cardinality of an $(a,b)$-dominating set of $G$ is the $(a,b)$-domination number of $G$, denoted by $\\gamma_{a,b}(G)$. There are various results about upper bounds for $\\gamma_{a,b}(G)$ when $G$ is regular or $a$ and $b$ are small numbers.\n  In the first part of this paper, for a given graph $G$ with the minimum degree o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04031","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-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWw88tAMG2cqjUBhEaEQcLJEadQlTSaLGERCo9UT9mdSOWuZWa+EJRIgnkyZIe69k2TjN0m6QlQAD1M7crqnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:20.553697Z"},"content_sha256":"54e2c7380de1cf53804a06a476bad7ad4b03a47ab1080137238a098352919ff1","schema_version":"1.0","event_id":"sha256:54e2c7380de1cf53804a06a476bad7ad4b03a47ab1080137238a098352919ff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/bundle.json","state_url":"https://pith.science/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/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-08T14:13:20Z","links":{"resolver":"https://pith.science/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV","bundle":"https://pith.science/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/bundle.json","state":"https://pith.science/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VBZMTYT2RLBIJHDRKQBNFDOWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7VBZMTYT2RLBIJHDRKQBNFDOWV","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":"dffe14f11443ffe580ac8a5e025a94e7952f25071424d3248848de8855452692","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T20:10:07Z","title_canon_sha256":"14e67526e97d614983137b21530cc2a99eeeb0259e409a37b6b57f8b012696cd"},"schema_version":"1.0","source":{"id":"1803.04031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04031","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04031v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04031","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"7VBZMTYT2RLB","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7VBZMTYT2RLBIJHD","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7VBZMTYT","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:54e2c7380de1cf53804a06a476bad7ad4b03a47ab1080137238a098352919ff1","target":"graph","created_at":"2026-05-18T00:21:33Z","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":"Let $G$ be a connected graph of order $n$ with vertex set $V(G)$. A subset $S\\subseteq V(G)$ is an $(a,b)$-dominating set if every vertex $v\\in S$ is adjacent to at least $a$ vertices in $S$ and every $v\\in V\\setminus S$ is adjacent to at least $b$ vertices in $S$. The minimum cardinality of an $(a,b)$-dominating set of $G$ is the $(a,b)$-domination number of $G$, denoted by $\\gamma_{a,b}(G)$. There are various results about upper bounds for $\\gamma_{a,b}(G)$ when $G$ is regular or $a$ and $b$ are small numbers.\n  In the first part of this paper, for a given graph $G$ with the minimum degree o","authors_text":"Amir Jafari, Sharareh Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T20:10:07Z","title":"Upper bounds for domination numbers of graphs using Tur\\'an's Theorem and Lov\\'asz local lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04031","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:ce87e62950d37cb3541409cc565b59c4b5f7bc9cbe9292ac1f4605c6e2818d05","target":"record","created_at":"2026-05-18T00:21:33Z","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":"dffe14f11443ffe580ac8a5e025a94e7952f25071424d3248848de8855452692","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T20:10:07Z","title_canon_sha256":"14e67526e97d614983137b21530cc2a99eeeb0259e409a37b6b57f8b012696cd"},"schema_version":"1.0","source":{"id":"1803.04031","kind":"arxiv","version":1}},"canonical_sha256":"fd43964f13d4561424e38aa016946eb55650467370899f5ce54e1dfbaded8465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd43964f13d4561424e38aa016946eb55650467370899f5ce54e1dfbaded8465","first_computed_at":"2026-05-18T00:21:33.147115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:33.147115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QuxphhOicZLRy9/UA5KHv+IqAvkxTXhU4XTzm2Amw4oMWN0GuVTpZRep7dl5lFmsQ3x8jvnT2HGiK0HbAGY/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:33.147769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce87e62950d37cb3541409cc565b59c4b5f7bc9cbe9292ac1f4605c6e2818d05","sha256:54e2c7380de1cf53804a06a476bad7ad4b03a47ab1080137238a098352919ff1"],"state_sha256":"110d68d7c25f4506c77bbfb7c571dce44343ae2e8694015454176a652b70123f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cODqdfITLCB5Tdbc/RmFO+Uw8tiwjR3kBZXimxBIH2k+NMTbox5yBU8dx3DkHIMnby6YVpf5Ueb2Fv8sXApNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:13:20.557325Z","bundle_sha256":"65fa396a2d685fac40acc12e9a3d0976f7f9141404794fb9abf31d6ae523bcc9"}}