{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M54KB465KQK3YZVDE7NSZKA6AA","short_pith_number":"pith:M54KB465","canonical_record":{"source":{"id":"1709.04720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"9a27b849fc2ca450b40997943ceb2166471c401e0a8d18b19657fad6321d172e","abstract_canon_sha256":"220eddeeeaf3863d6639442d65d4e3526255369f9a48f3ad1898c80421ab14ae"},"schema_version":"1.0"},"canonical_sha256":"6778a0f3dd5415bc66a327db2ca81e002530fcea990a38882666083e0ca3cd84","source":{"kind":"arxiv","id":"1709.04720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04720","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04720v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04720","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"M54KB465KQK3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M54KB465KQK3YZVD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M54KB465","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M54KB465KQK3YZVDE7NSZKA6AA","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"9a27b849fc2ca450b40997943ceb2166471c401e0a8d18b19657fad6321d172e","abstract_canon_sha256":"220eddeeeaf3863d6639442d65d4e3526255369f9a48f3ad1898c80421ab14ae"},"schema_version":"1.0"},"canonical_sha256":"6778a0f3dd5415bc66a327db2ca81e002530fcea990a38882666083e0ca3cd84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.321417Z","signature_b64":"sOX3HtaPSaEoL2D34iQdmNLB127vvpbz+JO9aWq8MpABdbDdflCfDOxaKKqkwmPW5qgKijpuYJdoJbbY/comBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6778a0f3dd5415bc66a327db2ca81e002530fcea990a38882666083e0ca3cd84","last_reissued_at":"2026-05-18T00:35:10.321019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.321019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04720","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkeu25sOp9u3XcQs2a7m5QsRncjnCZM341gz1YNJroZHzniBRYRe7dT5IyYPOjHeQv0y6xzd7AJng+YUBvcpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:07:17.670797Z"},"content_sha256":"0dcf99d7a95cbbb90a92d6b85541634279d93c75ee085ad06e442563a13dc780","schema_version":"1.0","event_id":"sha256:0dcf99d7a95cbbb90a92d6b85541634279d93c75ee085ad06e442563a13dc780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M54KB465KQK3YZVDE7NSZKA6AA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improvement on the maximum number of $k$-Dominating Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2017-09-14T12:04:18Z","abstract_excerpt":"Erd\\H{o}s and Moser raised the question of determining the maximum number of maximal cliques or equivalently, the maximum number of maximal independent sets in a graph on $n$ vertices. Since then there has been a lot of research along these lines.\n  A $k$-dominating independent set is an independent set $D$ such that every vertex not contained in $D$ has at least $k$ neighbours in $D$. Let $mi_k(n)$ denote the maximum number of $k$-dominating independent sets in a graph on $n$ vertices, and let $\\zeta_k:=\\lim_{n \\rightarrow \\infty} \\sqrt[n]{mi_k(n)}$. Nagy initiated the study of $mi_k(n)$.\n  I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04720","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qj+ECycoj8VNPEPXvNXurppPl1WYIHWJY0A4K9QIsXD+3Vj4E58SsvdfLUZ1Zu+ntBO/v2jeUNxYzmSsNdccAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:07:17.671141Z"},"content_sha256":"6ed37ed97f631012b72b51bda076621e2f68343b77000d2dd54b03a78d595f7e","schema_version":"1.0","event_id":"sha256:6ed37ed97f631012b72b51bda076621e2f68343b77000d2dd54b03a78d595f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M54KB465KQK3YZVDE7NSZKA6AA/bundle.json","state_url":"https://pith.science/pith/M54KB465KQK3YZVDE7NSZKA6AA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M54KB465KQK3YZVDE7NSZKA6AA/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-01T06:07:17Z","links":{"resolver":"https://pith.science/pith/M54KB465KQK3YZVDE7NSZKA6AA","bundle":"https://pith.science/pith/M54KB465KQK3YZVDE7NSZKA6AA/bundle.json","state":"https://pith.science/pith/M54KB465KQK3YZVDE7NSZKA6AA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M54KB465KQK3YZVDE7NSZKA6AA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M54KB465KQK3YZVDE7NSZKA6AA","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":"220eddeeeaf3863d6639442d65d4e3526255369f9a48f3ad1898c80421ab14ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:04:18Z","title_canon_sha256":"9a27b849fc2ca450b40997943ceb2166471c401e0a8d18b19657fad6321d172e"},"schema_version":"1.0","source":{"id":"1709.04720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04720","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04720v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04720","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"M54KB465KQK3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M54KB465KQK3YZVD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M54KB465","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:6ed37ed97f631012b72b51bda076621e2f68343b77000d2dd54b03a78d595f7e","target":"graph","created_at":"2026-05-18T00:35:10Z","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":"Erd\\H{o}s and Moser raised the question of determining the maximum number of maximal cliques or equivalently, the maximum number of maximal independent sets in a graph on $n$ vertices. Since then there has been a lot of research along these lines.\n  A $k$-dominating independent set is an independent set $D$ such that every vertex not contained in $D$ has at least $k$ neighbours in $D$. Let $mi_k(n)$ denote the maximum number of $k$-dominating independent sets in a graph on $n$ vertices, and let $\\zeta_k:=\\lim_{n \\rightarrow \\infty} \\sqrt[n]{mi_k(n)}$. Nagy initiated the study of $mi_k(n)$.\n  I","authors_text":"Abhishek Methuku, Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:04:18Z","title":"An improvement on the maximum number of $k$-Dominating Independent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04720","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:0dcf99d7a95cbbb90a92d6b85541634279d93c75ee085ad06e442563a13dc780","target":"record","created_at":"2026-05-18T00:35:10Z","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":"220eddeeeaf3863d6639442d65d4e3526255369f9a48f3ad1898c80421ab14ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:04:18Z","title_canon_sha256":"9a27b849fc2ca450b40997943ceb2166471c401e0a8d18b19657fad6321d172e"},"schema_version":"1.0","source":{"id":"1709.04720","kind":"arxiv","version":1}},"canonical_sha256":"6778a0f3dd5415bc66a327db2ca81e002530fcea990a38882666083e0ca3cd84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6778a0f3dd5415bc66a327db2ca81e002530fcea990a38882666083e0ca3cd84","first_computed_at":"2026-05-18T00:35:10.321019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.321019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sOX3HtaPSaEoL2D34iQdmNLB127vvpbz+JO9aWq8MpABdbDdflCfDOxaKKqkwmPW5qgKijpuYJdoJbbY/comBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.321417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dcf99d7a95cbbb90a92d6b85541634279d93c75ee085ad06e442563a13dc780","sha256:6ed37ed97f631012b72b51bda076621e2f68343b77000d2dd54b03a78d595f7e"],"state_sha256":"b3fd996e35f64a61400bc439b963df7b5bfc2453aa78216c624d64201f585bfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+51ThxgHCukaxPab9lSMow5Tgq0gAN5AgX0cSBopMvoA85WaK2rNXdKc+oGLZwV3hxxXnYrysOIFJioVME/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:07:17.673215Z","bundle_sha256":"d307df96f8f795b96f6d5b4878e434222f30bac5c8fbd808744b2fb6c9e7b0c1"}}