{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QPIEJKGRM7S7DO2RWNWSG77NGP","short_pith_number":"pith:QPIEJKGR","schema_version":"1.0","canonical_sha256":"83d044a8d167e5f1bb51b36d237fed33c735ce61c0850dd30512eee951d77ab7","source":{"kind":"arxiv","id":"1308.2858","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms for Modular-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jakub Gajarsk\\'y, Michael Lampis, Sebastian Ordyniak","submitted_at":"2013-08-13T13:22:02Z","abstract_excerpt":"It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty.\n  The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths "},"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":"1308.2858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-13T13:22:02Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"33cc7e9a94d00e541e9d64f6004a3a4ab5d0a25fece9bc588201d249aa6baf36","abstract_canon_sha256":"1e30319d31f242515d7080555fd42d5d42e114c63e220b020fd42b32fbe71b28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:57.077861Z","signature_b64":"/r1FUe2oTxATw5L3IK3gkTYcols/fNv56pwmcTw1fuo9mSsaljSjtFB64hLo3SIdgZ8ASNCNa6aNFaSWW9tnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d044a8d167e5f1bb51b36d237fed33c735ce61c0850dd30512eee951d77ab7","last_reissued_at":"2026-05-18T03:15:57.077200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:57.077200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Modular-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jakub Gajarsk\\'y, Michael Lampis, Sebastian Ordyniak","submitted_at":"2013-08-13T13:22:02Z","abstract_excerpt":"It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty.\n  The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2858","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":"1308.2858","created_at":"2026-05-18T03:15:57.077306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2858v2","created_at":"2026-05-18T03:15:57.077306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2858","created_at":"2026-05-18T03:15:57.077306+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPIEJKGRM7S7","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPIEJKGRM7S7DO2R","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPIEJKGR","created_at":"2026-05-18T12:27:57.521954+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/QPIEJKGRM7S7DO2RWNWSG77NGP","json":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP.json","graph_json":"https://pith.science/api/pith-number/QPIEJKGRM7S7DO2RWNWSG77NGP/graph.json","events_json":"https://pith.science/api/pith-number/QPIEJKGRM7S7DO2RWNWSG77NGP/events.json","paper":"https://pith.science/paper/QPIEJKGR"},"agent_actions":{"view_html":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP","download_json":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP.json","view_paper":"https://pith.science/paper/QPIEJKGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2858&json=true","fetch_graph":"https://pith.science/api/pith-number/QPIEJKGRM7S7DO2RWNWSG77NGP/graph.json","fetch_events":"https://pith.science/api/pith-number/QPIEJKGRM7S7DO2RWNWSG77NGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP/action/storage_attestation","attest_author":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP/action/author_attestation","sign_citation":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP/action/citation_signature","submit_replication":"https://pith.science/pith/QPIEJKGRM7S7DO2RWNWSG77NGP/action/replication_record"}},"created_at":"2026-05-18T03:15:57.077306+00:00","updated_at":"2026-05-18T03:15:57.077306+00:00"}