{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RUELNQY3OSQQ4PEV3LFFKNVDNJ","short_pith_number":"pith:RUELNQY3","schema_version":"1.0","canonical_sha256":"8d08b6c31b74a10e3c95daca5536a36a5621481abe3d89f516e0f4d1d855d863","source":{"kind":"arxiv","id":"1410.2209","version":1},"attestation_state":"computed","paper":{"title":"Families with infants: speeding up algorithms for NP-hard problems using FFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin","submitted_at":"2014-10-08T18:27:38Z","abstract_excerpt":"Assume that a group of people is going to an excursion and our task is to seat them into buses with several constraints each saying that a pair of people does not want to see each other in the same bus. This is a well-known coloring problem and it can be solved in $O^*(2^n)$ time by the inclusion-exclusion principle as shown by Bj\\\"{o}rklund, Husfeldt, and Koivisto in 2009.Another approach to solve this problem in $O^*(2^n)$ time is to use the fast Fourier transform. A graph is $k$-colorable if and only if the $k$-th power of a polynomial containing a monomial $\\prod_{i=1}^n x_i^{[i \\in I]}$ f"},"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":"1410.2209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-08T18:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"0a136778c3b660b88f808ae339350145c98699a7828814bd1dd133e8e72c0889","abstract_canon_sha256":"131efa95e0758414b684adaabcdf8e5cc8a3dc02fbc14d0ac76f53be0b063101"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.965388Z","signature_b64":"CygR+XxOyZCqY2etQvgVqCaGWh4aLVck/fi0v8NaOk/R5v/Zu6bxXLrLw52/+0hLBatujPIr78EfEXv+9E5eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d08b6c31b74a10e3c95daca5536a36a5621481abe3d89f516e0f4d1d855d863","last_reissued_at":"2026-05-18T02:40:47.964811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.964811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families with infants: speeding up algorithms for NP-hard problems using FFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin","submitted_at":"2014-10-08T18:27:38Z","abstract_excerpt":"Assume that a group of people is going to an excursion and our task is to seat them into buses with several constraints each saying that a pair of people does not want to see each other in the same bus. This is a well-known coloring problem and it can be solved in $O^*(2^n)$ time by the inclusion-exclusion principle as shown by Bj\\\"{o}rklund, Husfeldt, and Koivisto in 2009.Another approach to solve this problem in $O^*(2^n)$ time is to use the fast Fourier transform. A graph is $k$-colorable if and only if the $k$-th power of a polynomial containing a monomial $\\prod_{i=1}^n x_i^{[i \\in I]}$ f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2209","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":"1410.2209","created_at":"2026-05-18T02:40:47.964912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2209v1","created_at":"2026-05-18T02:40:47.964912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2209","created_at":"2026-05-18T02:40:47.964912+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUELNQY3OSQQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUELNQY3OSQQ4PEV","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUELNQY3","created_at":"2026-05-18T12:28:46.137349+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/RUELNQY3OSQQ4PEV3LFFKNVDNJ","json":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ.json","graph_json":"https://pith.science/api/pith-number/RUELNQY3OSQQ4PEV3LFFKNVDNJ/graph.json","events_json":"https://pith.science/api/pith-number/RUELNQY3OSQQ4PEV3LFFKNVDNJ/events.json","paper":"https://pith.science/paper/RUELNQY3"},"agent_actions":{"view_html":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ","download_json":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ.json","view_paper":"https://pith.science/paper/RUELNQY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2209&json=true","fetch_graph":"https://pith.science/api/pith-number/RUELNQY3OSQQ4PEV3LFFKNVDNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RUELNQY3OSQQ4PEV3LFFKNVDNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ/action/storage_attestation","attest_author":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ/action/author_attestation","sign_citation":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ/action/citation_signature","submit_replication":"https://pith.science/pith/RUELNQY3OSQQ4PEV3LFFKNVDNJ/action/replication_record"}},"created_at":"2026-05-18T02:40:47.964912+00:00","updated_at":"2026-05-18T02:40:47.964912+00:00"}