{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NW4TE6Y4BA23SXIVTJUKHHNWP5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e16886b5d43a66e6dee35d1a737546fa1f219c4b04aee6f9ccd07ea161abb832","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T14:52:04Z","title_canon_sha256":"96275e09069ddcceb3157ff9ccdb73a4317ca666a5946e57da31847ba4d7d74b"},"schema_version":"1.0","source":{"id":"1809.08160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08160","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08160v2","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08160","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"NW4TE6Y4BA23","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NW4TE6Y4BA23SXIV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NW4TE6Y4","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7e4547b519bac1502cdfdaaac41219746885ff3f63a818b9204a4f260c67d6b0","target":"graph","created_at":"2026-05-18T00:04:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dimitrios M. Thilikos, Eun Jung Kim, Maria Serna","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T14:52:04Z","title":"Data-compression for Parametrized Counting Problems on Sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08160","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f5be9cbf4db7de3dd58ad349490f79ae92ccd10f1e8834d54f6411239a106042","target":"record","created_at":"2026-05-18T00:04:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e16886b5d43a66e6dee35d1a737546fa1f219c4b04aee6f9ccd07ea161abb832","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T14:52:04Z","title_canon_sha256":"96275e09069ddcceb3157ff9ccdb73a4317ca666a5946e57da31847ba4d7d74b"},"schema_version":"1.0","source":{"id":"1809.08160","kind":"arxiv","version":2}},"canonical_sha256":"6db9327b1c0835b95d159a68a39db67f51c471be954563630e83ec874fa52d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6db9327b1c0835b95d159a68a39db67f51c471be954563630e83ec874fa52d13","first_computed_at":"2026-05-18T00:04:54.294961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:54.294961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QugwgzTtXRm213u52++PMitjLX/6hFzQ8qxP1vPPo5mpMD4cVjTHH8wMgZC3D2jQpF3/Ce4dNv3i555ExnhUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:54.295680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5be9cbf4db7de3dd58ad349490f79ae92ccd10f1e8834d54f6411239a106042","sha256:7e4547b519bac1502cdfdaaac41219746885ff3f63a818b9204a4f260c67d6b0"],"state_sha256":"4543a7b85445aca99719242ae305552f0ec889ad1e04c2c240b08127dccec2a0"}