{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B5JQLL26DFLHKDMFBRWRLAVMDI","short_pith_number":"pith:B5JQLL26","schema_version":"1.0","canonical_sha256":"0f5305af5e1956750d850c6d1582ac1a0750c2d23f1617ea2255d0f2ffc30e4f","source":{"kind":"arxiv","id":"1203.3727","version":3},"attestation_state":"computed","paper":{"title":"Linear vertex-kernels for several dense ranking r-CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Anthony Perez","submitted_at":"2012-03-16T15:01:40Z","abstract_excerpt":"A Ranking r-Constraint Satisfaction Problem (ranking r-CSP) consists of a ground set of vertices V, an arity r >= 2, a parameter k and a constraint system c, where c is a function which maps rankings of r-sized subsets of V to {0,1}. The objective is to decide if there exists a ranking of the vertices satisfying all but at most k constraints. Famous ranking r-CSP include the Feedback Arc Set in Tournaments and Betweenness in Tournaments problems. We consider these problems from the kernelization viewpoint. We prove that so-called l_r-simply characterized ranking r-CSPs admit linear vertex-kern"},"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":"1203.3727","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-16T15:01:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bbb8f723d101cbb6161a686327b7aaa5ba39b35061605f9a048aea4b868d2011","abstract_canon_sha256":"973a568a95fec5b14b2f61299199a32a798a6aa94f0182bd3f48e4206e7f2aa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.903037Z","signature_b64":"Pwc2A28yiUevo2pTiDDZCuNxnktOb/dK020DsHn9LAqKe559k4N3xEdjm0XdyBLwxZiMz4LFkS/GDR4N0pVHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5305af5e1956750d850c6d1582ac1a0750c2d23f1617ea2255d0f2ffc30e4f","last_reissued_at":"2026-05-18T03:42:23.902380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.902380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear vertex-kernels for several dense ranking r-CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Anthony Perez","submitted_at":"2012-03-16T15:01:40Z","abstract_excerpt":"A Ranking r-Constraint Satisfaction Problem (ranking r-CSP) consists of a ground set of vertices V, an arity r >= 2, a parameter k and a constraint system c, where c is a function which maps rankings of r-sized subsets of V to {0,1}. The objective is to decide if there exists a ranking of the vertices satisfying all but at most k constraints. Famous ranking r-CSP include the Feedback Arc Set in Tournaments and Betweenness in Tournaments problems. We consider these problems from the kernelization viewpoint. We prove that so-called l_r-simply characterized ranking r-CSPs admit linear vertex-kern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3727","kind":"arxiv","version":3},"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":"1203.3727","created_at":"2026-05-18T03:42:23.902482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3727v3","created_at":"2026-05-18T03:42:23.902482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3727","created_at":"2026-05-18T03:42:23.902482+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5JQLL26DFLH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5JQLL26DFLHKDMF","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5JQLL26","created_at":"2026-05-18T12:26:58.693483+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/B5JQLL26DFLHKDMFBRWRLAVMDI","json":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI.json","graph_json":"https://pith.science/api/pith-number/B5JQLL26DFLHKDMFBRWRLAVMDI/graph.json","events_json":"https://pith.science/api/pith-number/B5JQLL26DFLHKDMFBRWRLAVMDI/events.json","paper":"https://pith.science/paper/B5JQLL26"},"agent_actions":{"view_html":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI","download_json":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI.json","view_paper":"https://pith.science/paper/B5JQLL26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3727&json=true","fetch_graph":"https://pith.science/api/pith-number/B5JQLL26DFLHKDMFBRWRLAVMDI/graph.json","fetch_events":"https://pith.science/api/pith-number/B5JQLL26DFLHKDMFBRWRLAVMDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI/action/storage_attestation","attest_author":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI/action/author_attestation","sign_citation":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI/action/citation_signature","submit_replication":"https://pith.science/pith/B5JQLL26DFLHKDMFBRWRLAVMDI/action/replication_record"}},"created_at":"2026-05-18T03:42:23.902482+00:00","updated_at":"2026-05-18T03:42:23.902482+00:00"}