{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7C3JVY3RUUYKXCJROZV2OZJE4B","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":"c9096bbeac2734bdb9dd41a19ac6f004cc604ee63f32524e03cc2d851abd45b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T10:32:11Z","title_canon_sha256":"7c5c847f7324493a1e06685472bedc07dd33452cd9093a88da6154004e215d3e"},"schema_version":"1.0","source":{"id":"1807.04997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04997","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04997v2","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04997","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"7C3JVY3RUUYK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7C3JVY3RUUYKXCJR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7C3JVY3R","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:b9f4ba0a8d0af4752976cae065b4a4409ea1fedcc352fd901731ae3b40f292ce","target":"graph","created_at":"2026-05-17T23:50:42Z","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":"For a fixed positive integer $k$, a set $S$ of vertices of a graph or multigraph is called a $k$-independent set if the subgraph induced by $S$ has maximum degree less than $k$. The well-known algorithm MAX finds a maximal $k$-independent set in a graph or multigraph by iteratively removing vertices of maximum degree until what remains has maximum degree less than $k$. We give an efficient procedure that determines, for a given degree sequence $D$, the smallest cardinality $b(D)$ of a $k$-independent set that can result from any application of MAX to any loopless multigraph with degree sequenc","authors_text":"Daniel Horsley, Nevena Franceti\\'c, Sara Herke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T10:32:11Z","title":"MAX for $k$-independence in multigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04997","kind":"arxiv","version":2},"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:406dd7ee74e2e4b7eeebf1fb4436b45a8fa371b765ad87a52f7eafcc2c09a1e8","target":"record","created_at":"2026-05-17T23:50:42Z","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":"c9096bbeac2734bdb9dd41a19ac6f004cc604ee63f32524e03cc2d851abd45b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T10:32:11Z","title_canon_sha256":"7c5c847f7324493a1e06685472bedc07dd33452cd9093a88da6154004e215d3e"},"schema_version":"1.0","source":{"id":"1807.04997","kind":"arxiv","version":2}},"canonical_sha256":"f8b69ae371a530ab8931766ba76524e05356c582c4623f158ae94cd1b2a61810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8b69ae371a530ab8931766ba76524e05356c582c4623f158ae94cd1b2a61810","first_computed_at":"2026-05-17T23:50:42.656869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:42.656869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4N322dxJOoFV3DxosDWzn0RRMn3727tXs0Oi/9U2K/wxShJ9O3YRQ9xLedsmW8THw0d5Tm8ipcVDAzuhzrSNAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:42.657269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:406dd7ee74e2e4b7eeebf1fb4436b45a8fa371b765ad87a52f7eafcc2c09a1e8","sha256:b9f4ba0a8d0af4752976cae065b4a4409ea1fedcc352fd901731ae3b40f292ce"],"state_sha256":"abaf5643c7209c8ebf4d93862d80f4cf0095a06fffb8e4cb48d1fce2e728a4c2"}