{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IDRSOLIVEGCCHHVWJW6LO44FUF","short_pith_number":"pith:IDRSOLIV","schema_version":"1.0","canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","source":{"kind":"arxiv","id":"1408.0828","version":1},"attestation_state":"computed","paper":{"title":"Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","submitted_at":"2014-08-04T22:01:59Z","abstract_excerpt":"The study of graph products is a major research topic and typically concerns the term $f(G*H)$, e.g., to show that $f(G*H)=f(G)f(H)$. In this paper, we study graph products in a non-standard form $f(R[G*H]$ where $R$ is a \"reduction\", a transformation of any graph into an instance of an intended optimization problem. We resolve some open problems as applications.\n  (1) A tight $n^{1-\\epsilon}$-approximation hardness for the minimum consistent deterministic finite automaton (DFA) problem, where $n$ is the sample size. Due to Board and Pitt [Theoretical Computer Science 1992], this implies the h"},"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":"1408.0828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-04T22:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"a9c811a427d1639f60beb30a72c24a8b760fe583ae8fbc24d9c97a2b82b75176","abstract_canon_sha256":"a3693378ab9d33fbabdcf8624114e893b469b317606caa78eb3b24be9ed143d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.308600Z","signature_b64":"HtP+Tmr/QRyrJQbnQDGoaooC02U3pZB10pUDJtNJ9PnJL+8sZXTAHAgK24Yby11mZdLYoAbvxb0/HTRRmWT/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","last_reissued_at":"2026-05-18T02:45:50.307976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.307976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","submitted_at":"2014-08-04T22:01:59Z","abstract_excerpt":"The study of graph products is a major research topic and typically concerns the term $f(G*H)$, e.g., to show that $f(G*H)=f(G)f(H)$. In this paper, we study graph products in a non-standard form $f(R[G*H]$ where $R$ is a \"reduction\", a transformation of any graph into an instance of an intended optimization problem. We resolve some open problems as applications.\n  (1) A tight $n^{1-\\epsilon}$-approximation hardness for the minimum consistent deterministic finite automaton (DFA) problem, where $n$ is the sample size. Due to Board and Pitt [Theoretical Computer Science 1992], this implies the h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0828","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":"1408.0828","created_at":"2026-05-18T02:45:50.308055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0828v1","created_at":"2026-05-18T02:45:50.308055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0828","created_at":"2026-05-18T02:45:50.308055+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDRSOLIVEGCC","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDRSOLIVEGCCHHVW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDRSOLIV","created_at":"2026-05-18T12:28:33.132498+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/IDRSOLIVEGCCHHVWJW6LO44FUF","json":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF.json","graph_json":"https://pith.science/api/pith-number/IDRSOLIVEGCCHHVWJW6LO44FUF/graph.json","events_json":"https://pith.science/api/pith-number/IDRSOLIVEGCCHHVWJW6LO44FUF/events.json","paper":"https://pith.science/paper/IDRSOLIV"},"agent_actions":{"view_html":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF","download_json":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF.json","view_paper":"https://pith.science/paper/IDRSOLIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0828&json=true","fetch_graph":"https://pith.science/api/pith-number/IDRSOLIVEGCCHHVWJW6LO44FUF/graph.json","fetch_events":"https://pith.science/api/pith-number/IDRSOLIVEGCCHHVWJW6LO44FUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/action/storage_attestation","attest_author":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/action/author_attestation","sign_citation":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/action/citation_signature","submit_replication":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/action/replication_record"}},"created_at":"2026-05-18T02:45:50.308055+00:00","updated_at":"2026-05-18T02:45:50.308055+00:00"}