{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NW4TE6Y4BA23SXIVTJUKHHNWP5","short_pith_number":"pith:NW4TE6Y4","schema_version":"1.0","canonical_sha256":"6db9327b1c0835b95d159a68a39db67f51c471be954563630e83ec874fa52d13","source":{"kind":"arxiv","id":"1809.08160","version":2},"attestation_state":"computed","paper":{"title":"Data-compression for Parametrized Counting Problems on Sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Eun Jung Kim, Maria Serna","submitted_at":"2018-09-21T14:52:04Z","abstract_excerpt":"We study the concept of \\emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function $F:\\Sigma^*\\to \\Bbb{N}$ and a parameterization $\\kappa: \\Sigma^*\\to \\Bbb{N}$, a compactor $({\\sf P},{\\sf M})$ consists of a polynomial-time computable function ${\\sf P}$, called \\emph{condenser}, and a computable function ${\\sf M}$, called \\emph{extractor}, such that $F={\\sf M}\\circ {\\sf P}$, and the condensing ${\\sf P}(x)$ of $x$ has length at most $s(\\kappa(x))$, for any input $x\\in \\Sigma^*.$ If $s$ is a polynomial function, then the compac"},"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":"1809.08160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T14:52:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96275e09069ddcceb3157ff9ccdb73a4317ca666a5946e57da31847ba4d7d74b","abstract_canon_sha256":"e16886b5d43a66e6dee35d1a737546fa1f219c4b04aee6f9ccd07ea161abb832"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:54.295680Z","signature_b64":"QugwgzTtXRm213u52++PMitjLX/6hFzQ8qxP1vPPo5mpMD4cVjTHH8wMgZC3D2jQpF3/Ce4dNv3i555ExnhUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6db9327b1c0835b95d159a68a39db67f51c471be954563630e83ec874fa52d13","last_reissued_at":"2026-05-18T00:04:54.294961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:54.294961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-compression for Parametrized Counting Problems on Sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Eun Jung Kim, Maria Serna","submitted_at":"2018-09-21T14:52:04Z","abstract_excerpt":"We study the concept of \\emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function $F:\\Sigma^*\\to \\Bbb{N}$ and a parameterization $\\kappa: \\Sigma^*\\to \\Bbb{N}$, a compactor $({\\sf P},{\\sf M})$ consists of a polynomial-time computable function ${\\sf P}$, called \\emph{condenser}, and a computable function ${\\sf M}$, called \\emph{extractor}, such that $F={\\sf M}\\circ {\\sf P}$, and the condensing ${\\sf P}(x)$ of $x$ has length at most $s(\\kappa(x))$, for any input $x\\in \\Sigma^*.$ If $s$ is a polynomial function, then the compac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08160","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":"1809.08160","created_at":"2026-05-18T00:04:54.295083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08160v2","created_at":"2026-05-18T00:04:54.295083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08160","created_at":"2026-05-18T00:04:54.295083+00:00"},{"alias_kind":"pith_short_12","alias_value":"NW4TE6Y4BA23","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NW4TE6Y4BA23SXIV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NW4TE6Y4","created_at":"2026-05-18T12:32:40.477152+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/NW4TE6Y4BA23SXIVTJUKHHNWP5","json":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5.json","graph_json":"https://pith.science/api/pith-number/NW4TE6Y4BA23SXIVTJUKHHNWP5/graph.json","events_json":"https://pith.science/api/pith-number/NW4TE6Y4BA23SXIVTJUKHHNWP5/events.json","paper":"https://pith.science/paper/NW4TE6Y4"},"agent_actions":{"view_html":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5","download_json":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5.json","view_paper":"https://pith.science/paper/NW4TE6Y4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08160&json=true","fetch_graph":"https://pith.science/api/pith-number/NW4TE6Y4BA23SXIVTJUKHHNWP5/graph.json","fetch_events":"https://pith.science/api/pith-number/NW4TE6Y4BA23SXIVTJUKHHNWP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5/action/storage_attestation","attest_author":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5/action/author_attestation","sign_citation":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5/action/citation_signature","submit_replication":"https://pith.science/pith/NW4TE6Y4BA23SXIVTJUKHHNWP5/action/replication_record"}},"created_at":"2026-05-18T00:04:54.295083+00:00","updated_at":"2026-05-18T00:04:54.295083+00:00"}