{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T7E7YFQTALGERMYUYPFIZT3IXX","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":"ad61303df0abca9ead6d8b36bc49cfa5607fb2d1d5d10f33e066f4dff1e20844","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-19T19:13:33Z","title_canon_sha256":"104deecdefeca06bebafa1cedcbc715e873d02533314e64dc530949e14f26e68"},"schema_version":"1.0","source":{"id":"1810.08657","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08657","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08657v4","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08657","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"pith_short_12","alias_value":"T7E7YFQTALGE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T7E7YFQTALGERMYU","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T7E7YFQT","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:197653c3fb46e3d2065edf3f40c01dc2cd24353a486434bd45f54ec2a6645350","target":"graph","created_at":"2026-05-17T23:43:56Z","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 dominating set of a graph $G$ is a set of vertices $D$ such that for all $v \\in V(G)$, either $v \\in D$ or $(v,d) \\in E(G)$ for some $d \\in D$. The cardinality redundance of a vertex set $S$, $CR(S)$, is the number of vertices in $V(G)$ such that $|N[x] \\cap S| \\geq 2$. The cardinality redundance of $G$ is the minimum of $CR(S)$ taken over all dominating sets $S$. A set that achieves $CR(G)$ is a $\\gamma_{cr}$-set, and the size of the minimum $\\gamma_{cr}$-set is $\\gamma_{cr}(G)$. We give the maximum number of edges in a graph with a given number of vertices and given cardinality redundance.","authors_text":"Daniel McGinnis, Nathan Shank","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-19T19:13:33Z","title":"Extremal Problems Related to the Cardinality Redundance of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08657","kind":"arxiv","version":4},"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:5565be6efb26168634c8db2f4671fb6581fd83055e41917955a844cf8fdd70b2","target":"record","created_at":"2026-05-17T23:43:56Z","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":"ad61303df0abca9ead6d8b36bc49cfa5607fb2d1d5d10f33e066f4dff1e20844","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-19T19:13:33Z","title_canon_sha256":"104deecdefeca06bebafa1cedcbc715e873d02533314e64dc530949e14f26e68"},"schema_version":"1.0","source":{"id":"1810.08657","kind":"arxiv","version":4}},"canonical_sha256":"9fc9fc161302cc48b314c3ca8ccf68bdca53c8027f00c4f8e8a4f7d50704f361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fc9fc161302cc48b314c3ca8ccf68bdca53c8027f00c4f8e8a4f7d50704f361","first_computed_at":"2026-05-17T23:43:56.459117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:56.459117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LDU6n72PWXq/RzKxQpxPadWQxGoDH2K6/8j9j4MX+jcK7190uXFZB2+Ud/I/5sLqOU+/7wBhyZQ79BTUSNQoCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:56.459823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08657","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5565be6efb26168634c8db2f4671fb6581fd83055e41917955a844cf8fdd70b2","sha256:197653c3fb46e3d2065edf3f40c01dc2cd24353a486434bd45f54ec2a6645350"],"state_sha256":"c3330c64a3fba37cc9dc0851106de9851600f6bd4ff8dbfdb67dc667820a676d"}