{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K5TGYWBD5CDFSDRP4PED6FY45N","short_pith_number":"pith:K5TGYWBD","canonical_record":{"source":{"id":"1302.0487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-03T13:32:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"72586a53e621f1bfd808238924b984a5601fc2aff64c22e3fe2a6abd80299bec","abstract_canon_sha256":"b443e3df1e1578620c20f5aed08ee5b82fb88232e7ee359f8db19e19897e3be2"},"schema_version":"1.0"},"canonical_sha256":"57666c5823e886590e2fe3c83f171ceb58f4cad798c6b978b57a917e77cf2807","source":{"kind":"arxiv","id":"1302.0487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0487","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0487v1","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0487","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"K5TGYWBD5CDF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K5TGYWBD5CDFSDRP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K5TGYWBD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K5TGYWBD5CDFSDRP4PED6FY45N","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-03T13:32:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"72586a53e621f1bfd808238924b984a5601fc2aff64c22e3fe2a6abd80299bec","abstract_canon_sha256":"b443e3df1e1578620c20f5aed08ee5b82fb88232e7ee359f8db19e19897e3be2"},"schema_version":"1.0"},"canonical_sha256":"57666c5823e886590e2fe3c83f171ceb58f4cad798c6b978b57a917e77cf2807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.020496Z","signature_b64":"sFCos+vjUXpl2J5oDEaI/2qIOMcn7nK2ihgzyBtNCKUwvSrXC4Ytx4YA0SQ3xDOgS4XgO7ScHPJrOBkxjZItCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57666c5823e886590e2fe3c83f171ceb58f4cad798c6b978b57a917e77cf2807","last_reissued_at":"2026-05-18T03:34:37.019855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.019855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0487","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89uueSlpohtSsyJZXEPIpS5CgbR5VTG3wH9i56/w76I+IC/BrSrcF3EbAf2xCDJEesCZTlueHhsq/i1YLezBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:16:05.480443Z"},"content_sha256":"362ccdc5843a4463b65e5f7e210847d282a5ac353c0bece6eda9d688b5af5f0a","schema_version":"1.0","event_id":"sha256:362ccdc5843a4463b65e5f7e210847d282a5ac353c0bece6eda9d688b5af5f0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K5TGYWBD5CDFSDRP4PED6FY45N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the dynamic compressibility of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Karthik S. Gurumoorthy","submitted_at":"2013-02-03T13:32:24Z","abstract_excerpt":"We define a new notion of compressibility of a set of numbers through the dynamics of a polynomial function. We provide approaches to solve the problem by reducing it to the multi-criteria traveling salesman problem through a series of transformations. We then establish computational complexity results by giving some NP-completeness proofs. We also discuss about a notion of $\\epsilon$ K-compressibility of a set, with regard to lossy compression and deduce the necessary condition for the given set to be $\\epsilon$ K-compressible. Finally, we conclude by providing a list of open problems solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0487","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERuo4P1VCxJrUpL/zTEjNz1H4elHnKptrJPrNdG0pd6BnJ7Lz/CfOqsk34RoJGfRbCXRQ88gYv/tqD0zovdPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:16:05.480790Z"},"content_sha256":"b399f49fef1d7f34a6a44e55e266679811af05bac7efc5068b512015eebb27bf","schema_version":"1.0","event_id":"sha256:b399f49fef1d7f34a6a44e55e266679811af05bac7efc5068b512015eebb27bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5TGYWBD5CDFSDRP4PED6FY45N/bundle.json","state_url":"https://pith.science/pith/K5TGYWBD5CDFSDRP4PED6FY45N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5TGYWBD5CDFSDRP4PED6FY45N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:16:05Z","links":{"resolver":"https://pith.science/pith/K5TGYWBD5CDFSDRP4PED6FY45N","bundle":"https://pith.science/pith/K5TGYWBD5CDFSDRP4PED6FY45N/bundle.json","state":"https://pith.science/pith/K5TGYWBD5CDFSDRP4PED6FY45N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5TGYWBD5CDFSDRP4PED6FY45N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K5TGYWBD5CDFSDRP4PED6FY45N","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":"b443e3df1e1578620c20f5aed08ee5b82fb88232e7ee359f8db19e19897e3be2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-03T13:32:24Z","title_canon_sha256":"72586a53e621f1bfd808238924b984a5601fc2aff64c22e3fe2a6abd80299bec"},"schema_version":"1.0","source":{"id":"1302.0487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0487","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0487v1","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0487","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"K5TGYWBD5CDF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K5TGYWBD5CDFSDRP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K5TGYWBD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:b399f49fef1d7f34a6a44e55e266679811af05bac7efc5068b512015eebb27bf","target":"graph","created_at":"2026-05-18T03:34:37Z","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 define a new notion of compressibility of a set of numbers through the dynamics of a polynomial function. We provide approaches to solve the problem by reducing it to the multi-criteria traveling salesman problem through a series of transformations. We then establish computational complexity results by giving some NP-completeness proofs. We also discuss about a notion of $\\epsilon$ K-compressibility of a set, with regard to lossy compression and deduce the necessary condition for the given set to be $\\epsilon$ K-compressible. Finally, we conclude by providing a list of open problems solutio","authors_text":"Karthik S. Gurumoorthy","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-03T13:32:24Z","title":"On the dynamic compressibility of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0487","kind":"arxiv","version":1},"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:362ccdc5843a4463b65e5f7e210847d282a5ac353c0bece6eda9d688b5af5f0a","target":"record","created_at":"2026-05-18T03:34:37Z","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":"b443e3df1e1578620c20f5aed08ee5b82fb88232e7ee359f8db19e19897e3be2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-03T13:32:24Z","title_canon_sha256":"72586a53e621f1bfd808238924b984a5601fc2aff64c22e3fe2a6abd80299bec"},"schema_version":"1.0","source":{"id":"1302.0487","kind":"arxiv","version":1}},"canonical_sha256":"57666c5823e886590e2fe3c83f171ceb58f4cad798c6b978b57a917e77cf2807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57666c5823e886590e2fe3c83f171ceb58f4cad798c6b978b57a917e77cf2807","first_computed_at":"2026-05-18T03:34:37.019855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:37.019855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sFCos+vjUXpl2J5oDEaI/2qIOMcn7nK2ihgzyBtNCKUwvSrXC4Ytx4YA0SQ3xDOgS4XgO7ScHPJrOBkxjZItCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:37.020496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:362ccdc5843a4463b65e5f7e210847d282a5ac353c0bece6eda9d688b5af5f0a","sha256:b399f49fef1d7f34a6a44e55e266679811af05bac7efc5068b512015eebb27bf"],"state_sha256":"4a1665f9b864156ac87058c097464ec670a27a4811733b4dd91b7892b35243aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNcF5itIKfI85NEzXx+v33F6O2hu8iyPy8xg2BuMESTooCDnqp+qOCG+maKHuIa3oqLhISD6XvCcJeV7JwaCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:16:05.482705Z","bundle_sha256":"56603859f94146102da80b2a8a7391efb2972bc6e8f503b7eb6a72fb10e521de"}}