{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7C3JVY3RUUYKXCJROZV2OZJE4B","short_pith_number":"pith:7C3JVY3R","schema_version":"1.0","canonical_sha256":"f8b69ae371a530ab8931766ba76524e05356c582c4623f158ae94cd1b2a61810","source":{"kind":"arxiv","id":"1807.04997","version":2},"attestation_state":"computed","paper":{"title":"MAX for $k$-independence in multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Nevena Franceti\\'c, Sara Herke","submitted_at":"2018-07-13T10:32:11Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.04997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T10:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"7c5c847f7324493a1e06685472bedc07dd33452cd9093a88da6154004e215d3e","abstract_canon_sha256":"c9096bbeac2734bdb9dd41a19ac6f004cc604ee63f32524e03cc2d851abd45b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.657269Z","signature_b64":"4N322dxJOoFV3DxosDWzn0RRMn3727tXs0Oi/9U2K/wxShJ9O3YRQ9xLedsmW8THw0d5Tm8ipcVDAzuhzrSNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b69ae371a530ab8931766ba76524e05356c582c4623f158ae94cd1b2a61810","last_reissued_at":"2026-05-17T23:50:42.656869Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.656869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAX for $k$-independence in multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Nevena Franceti\\'c, Sara Herke","submitted_at":"2018-07-13T10:32:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04997","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04997","created_at":"2026-05-17T23:50:42.656943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04997v2","created_at":"2026-05-17T23:50:42.656943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04997","created_at":"2026-05-17T23:50:42.656943+00:00"},{"alias_kind":"pith_short_12","alias_value":"7C3JVY3RUUYK","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7C3JVY3RUUYKXCJR","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7C3JVY3R","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B","json":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B.json","graph_json":"https://pith.science/api/pith-number/7C3JVY3RUUYKXCJROZV2OZJE4B/graph.json","events_json":"https://pith.science/api/pith-number/7C3JVY3RUUYKXCJROZV2OZJE4B/events.json","paper":"https://pith.science/paper/7C3JVY3R"},"agent_actions":{"view_html":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B","download_json":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B.json","view_paper":"https://pith.science/paper/7C3JVY3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04997&json=true","fetch_graph":"https://pith.science/api/pith-number/7C3JVY3RUUYKXCJROZV2OZJE4B/graph.json","fetch_events":"https://pith.science/api/pith-number/7C3JVY3RUUYKXCJROZV2OZJE4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B/action/storage_attestation","attest_author":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B/action/author_attestation","sign_citation":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B/action/citation_signature","submit_replication":"https://pith.science/pith/7C3JVY3RUUYKXCJROZV2OZJE4B/action/replication_record"}},"created_at":"2026-05-17T23:50:42.656943+00:00","updated_at":"2026-05-17T23:50:42.656943+00:00"}