{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AE6HQFO4VHGHA3JGDG5CP55WJ2","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":"0f0474966e1a20b98fdaec5a0b474747e72afe66a3b21e80420d91ab0e63bc56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T14:56:50Z","title_canon_sha256":"53858f2e460326d059d5292dc43f7a04241548a224a4cf52150e2280caa4974e"},"schema_version":"1.0","source":{"id":"1311.2456","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2456","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2456v2","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2456","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"AE6HQFO4VHGH","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AE6HQFO4VHGHA3JG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AE6HQFO4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:ede45a9645380edb8fed5663e0e657b76bba677d2dfb119107e0ff2f27bd52f5","target":"graph","created_at":"2026-05-18T02:40:45Z","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 introduce a general approach for solving partition problems where the goal is to represent a given set as a union (either disjoint or not) of subsets satisfying certain properties. Many NP-hard problems can be naturally stated as such partition problems. We show that if one can find a large enough system of so-called families with infants for a given problem, then this problem can be solved faster than by a straightforward algorithm. We use this approach to improve known bounds for several NP-hard problems as well as to simplify the proofs of several known results.\n  For the chromatic numbe","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T14:56:50Z","title":"Families with infants: a general approach to solve hard partition problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2456","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:1cb61ed6da9a45a9a3c4c8363032335ead083a99265690ddfaf6ae7928e08cf5","target":"record","created_at":"2026-05-18T02:40:45Z","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":"0f0474966e1a20b98fdaec5a0b474747e72afe66a3b21e80420d91ab0e63bc56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T14:56:50Z","title_canon_sha256":"53858f2e460326d059d5292dc43f7a04241548a224a4cf52150e2280caa4974e"},"schema_version":"1.0","source":{"id":"1311.2456","kind":"arxiv","version":2}},"canonical_sha256":"013c7815dca9cc706d2619ba27f7b64e8655b08f50015d7b292514e996fa2917","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"013c7815dca9cc706d2619ba27f7b64e8655b08f50015d7b292514e996fa2917","first_computed_at":"2026-05-18T02:40:45.696388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:45.696388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUXgInyyZYq5/1uJ7Xr0ATDE2WonRzFJpeMKZdo5NZO4PgvuWfdha8r26C75N7MWNmlGD0IhHUZQ6j2CzEHqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:45.697034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2456","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cb61ed6da9a45a9a3c4c8363032335ead083a99265690ddfaf6ae7928e08cf5","sha256:ede45a9645380edb8fed5663e0e657b76bba677d2dfb119107e0ff2f27bd52f5"],"state_sha256":"88ab1352275b392ff7578fd23f9614af1cc46eb0634372e2ab31c5423e0b60c1"}