{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5WJSOYHV2RYBDSG3XEZ72PIBZB","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":"8b8719a85544430a134018a4efbd70dd4b24ab6300bebb405815b4a59ee6c403","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-12T14:07:08Z","title_canon_sha256":"d892c817ee43dfc220ceaf388cad89e8b1e3e2636383fbd61987fc5fff27bf8b"},"schema_version":"1.0","source":{"id":"1410.3091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3091","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3091v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3091","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"5WJSOYHV2RYB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5WJSOYHV2RYBDSG3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5WJSOYHV","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:af84058f3d848dc0aef9a89bc566c91aeafa998c11c70a87e377176f90fad5a5","target":"graph","created_at":"2026-05-18T02:40:17Z","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 $D \\subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \\in V \\setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as $\\gamma_{(1,j)} (G)$, is called the $(1, j)$-domination number of $G$. Given a graph $G = (V, E)$ and an integer $k$, the decision version of the $(1, j)$-set problem is to decide whether $G$ has a $(1, j)$-set of cardinality at most $k$. In this paper, we first obtain an upper bound on $\\gamma_{(1,j)} (G)$ using probabilistic methods, for bounded minimum and maximum","authors_text":"Arijit Bishnu, Arijit Ghosh, Kunal Dutta, Subhabrata Paul","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-12T14:07:08Z","title":"$(1,j)$-set problem in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3091","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:9bb9d8f3b7478c6729121c42fa6d718012ed2abfc4d16150b9aa27c6b52a3911","target":"record","created_at":"2026-05-18T02:40:17Z","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":"8b8719a85544430a134018a4efbd70dd4b24ab6300bebb405815b4a59ee6c403","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-12T14:07:08Z","title_canon_sha256":"d892c817ee43dfc220ceaf388cad89e8b1e3e2636383fbd61987fc5fff27bf8b"},"schema_version":"1.0","source":{"id":"1410.3091","kind":"arxiv","version":1}},"canonical_sha256":"ed932760f5d47011c8dbb933fd3d01c86abaea62beeb2136a02b8aae77f565bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed932760f5d47011c8dbb933fd3d01c86abaea62beeb2136a02b8aae77f565bb","first_computed_at":"2026-05-18T02:40:17.071343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:17.071343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L33EWQNW9vWNTHX4ATa3sC+Lt5PxARfen3O7UD1kCuZWFdgkkaYONgsemB65RTnCIyI+GJU2T6OGjHhNOsOIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:17.071762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bb9d8f3b7478c6729121c42fa6d718012ed2abfc4d16150b9aa27c6b52a3911","sha256:af84058f3d848dc0aef9a89bc566c91aeafa998c11c70a87e377176f90fad5a5"],"state_sha256":"74e82925979e7aeecf580e823145c0b3664443e2bff6d2f36f1e64e1fa9d02ea"}