{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FZXW7YZBKDUH74BKPM5NGNLTCM","short_pith_number":"pith:FZXW7YZB","schema_version":"1.0","canonical_sha256":"2e6f6fe32150e87ff02a7b3ad33573133a5ad619c5b1f9ecffa74fd9aa29d6b4","source":{"kind":"arxiv","id":"1506.07729","version":1},"attestation_state":"computed","paper":{"title":"A structural approach to kernels for ILPs: Treewidth and Total Unimodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Stefan Kratsch","submitted_at":"2015-06-25T12:47:56Z","abstract_excerpt":"Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-the-art ILP-solvers like CPLEX. Motivated by this, previous work studied the existence of kernelizations for ILP related problems, e.g., for testing feasibility of Ax <= b. In contrast to the observed success of CPLEX, however, the results were largely negative. Intuitively, practical instances have far more useful structure than the worst-case instances used to prove these lower bounds.\n  In the present paper, we stu"},"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":"1506.07729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-25T12:47:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"75f11d73aa194e66802d29b1b0c45367706440a49c5a8d68da7af55b60b8d59d","abstract_canon_sha256":"e5f7c6fd782c70d7a186bba00b6b60701b18087f187c95b7ac22c349fd33104c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:51.032770Z","signature_b64":"8ME2hVCSVzivVu5OE/C/OZMytv3QY9v4XYxXGfZg+DTRvvNffQZbl3Lnf7l2btIUK+iWIHBow8emuGI7o2ddDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e6f6fe32150e87ff02a7b3ad33573133a5ad619c5b1f9ecffa74fd9aa29d6b4","last_reissued_at":"2026-05-18T01:38:51.032179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:51.032179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A structural approach to kernels for ILPs: Treewidth and Total Unimodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Stefan Kratsch","submitted_at":"2015-06-25T12:47:56Z","abstract_excerpt":"Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-the-art ILP-solvers like CPLEX. Motivated by this, previous work studied the existence of kernelizations for ILP related problems, e.g., for testing feasibility of Ax <= b. In contrast to the observed success of CPLEX, however, the results were largely negative. Intuitively, practical instances have far more useful structure than the worst-case instances used to prove these lower bounds.\n  In the present paper, we stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07729","kind":"arxiv","version":1},"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":"1506.07729","created_at":"2026-05-18T01:38:51.032255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07729v1","created_at":"2026-05-18T01:38:51.032255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07729","created_at":"2026-05-18T01:38:51.032255+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZXW7YZBKDUH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZXW7YZBKDUH74BK","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZXW7YZB","created_at":"2026-05-18T12:29:22.688609+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/FZXW7YZBKDUH74BKPM5NGNLTCM","json":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM.json","graph_json":"https://pith.science/api/pith-number/FZXW7YZBKDUH74BKPM5NGNLTCM/graph.json","events_json":"https://pith.science/api/pith-number/FZXW7YZBKDUH74BKPM5NGNLTCM/events.json","paper":"https://pith.science/paper/FZXW7YZB"},"agent_actions":{"view_html":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM","download_json":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM.json","view_paper":"https://pith.science/paper/FZXW7YZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07729&json=true","fetch_graph":"https://pith.science/api/pith-number/FZXW7YZBKDUH74BKPM5NGNLTCM/graph.json","fetch_events":"https://pith.science/api/pith-number/FZXW7YZBKDUH74BKPM5NGNLTCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM/action/storage_attestation","attest_author":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM/action/author_attestation","sign_citation":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM/action/citation_signature","submit_replication":"https://pith.science/pith/FZXW7YZBKDUH74BKPM5NGNLTCM/action/replication_record"}},"created_at":"2026-05-18T01:38:51.032255+00:00","updated_at":"2026-05-18T01:38:51.032255+00:00"}