{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:O7QZ6OFB7DC5EOBVIIB4RDCD5B","short_pith_number":"pith:O7QZ6OFB","schema_version":"1.0","canonical_sha256":"77e19f38a1f8c5d238354203c88c43e8463389ffef6df6f20c9a08c763c1f549","source":{"kind":"arxiv","id":"1009.5143","version":2},"attestation_state":"computed","paper":{"title":"FAST: Kernelization based on Graph Modular Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yixin Cao","submitted_at":"2010-09-27T02:29:59Z","abstract_excerpt":"Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of final results. This characteristic excludes the freedom of applying a kernelization algorithm for the weighted version of a problem to its unweighted instances. Thus with only very few special cases, kernelization algorithms have to be studied separately for weigthed and unweighted versions of a single problem. {\\sc feedback arc set on tournament} is currently a very popular problem in recent research of parameterized, a"},"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":"1009.5143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T02:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"9e25ff7ff9e1a620b903ead85a3381886826f4ff47ae809b6e96df25534b2c1e","abstract_canon_sha256":"40d408752da4a33a77bcb7ad6c21335baa808393ec4b8173ccce3c6ac4fe1501"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.431327Z","signature_b64":"DgGwYp09b+FRhOBR7OcVNpj7MV475Fb0uh9JT0ZAzex6FG/fxWy24kTkXdl/uBNtMBIkK6fWnvovuS0iJVUdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e19f38a1f8c5d238354203c88c43e8463389ffef6df6f20c9a08c763c1f549","last_reissued_at":"2026-05-18T04:40:00.430896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.430896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FAST: Kernelization based on Graph Modular Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yixin Cao","submitted_at":"2010-09-27T02:29:59Z","abstract_excerpt":"Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of final results. This characteristic excludes the freedom of applying a kernelization algorithm for the weighted version of a problem to its unweighted instances. Thus with only very few special cases, kernelization algorithms have to be studied separately for weigthed and unweighted versions of a single problem. {\\sc feedback arc set on tournament} is currently a very popular problem in recent research of parameterized, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5143","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":"1009.5143","created_at":"2026-05-18T04:40:00.430957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5143v2","created_at":"2026-05-18T04:40:00.430957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5143","created_at":"2026-05-18T04:40:00.430957+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7QZ6OFB7DC5","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7QZ6OFB7DC5EOBV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7QZ6OFB","created_at":"2026-05-18T12:26:12.377268+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/O7QZ6OFB7DC5EOBVIIB4RDCD5B","json":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B.json","graph_json":"https://pith.science/api/pith-number/O7QZ6OFB7DC5EOBVIIB4RDCD5B/graph.json","events_json":"https://pith.science/api/pith-number/O7QZ6OFB7DC5EOBVIIB4RDCD5B/events.json","paper":"https://pith.science/paper/O7QZ6OFB"},"agent_actions":{"view_html":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B","download_json":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B.json","view_paper":"https://pith.science/paper/O7QZ6OFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5143&json=true","fetch_graph":"https://pith.science/api/pith-number/O7QZ6OFB7DC5EOBVIIB4RDCD5B/graph.json","fetch_events":"https://pith.science/api/pith-number/O7QZ6OFB7DC5EOBVIIB4RDCD5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B/action/storage_attestation","attest_author":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B/action/author_attestation","sign_citation":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B/action/citation_signature","submit_replication":"https://pith.science/pith/O7QZ6OFB7DC5EOBVIIB4RDCD5B/action/replication_record"}},"created_at":"2026-05-18T04:40:00.430957+00:00","updated_at":"2026-05-18T04:40:00.430957+00:00"}