{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IDRSOLIVEGCCHHVWJW6LO44FUF","short_pith_number":"pith:IDRSOLIV","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"},"canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","source":{"kind":"arxiv","id":"1408.0828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0828","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0828v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0828","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"IDRSOLIVEGCC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDRSOLIVEGCCHHVW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDRSOLIV","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IDRSOLIVEGCCHHVWJW6LO44FUF","target":"record","payload":{"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"},"canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","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"},"source_kind":"arxiv","source_id":"1408.0828","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oru3HZKC/oqUyAoxwksPh5zxALokp2OIj4K7oJ6wyHyzXjvSqZTTfsaXvmKFs5AplfrR9TsTYy3whe/aqcVbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:50:22.736991Z"},"content_sha256":"3465e09acf89565494a98d8c788d4ff466f772e3635f6a745631b5f6517c4a9f","schema_version":"1.0","event_id":"sha256:3465e09acf89565494a98d8c788d4ff466f772e3635f6a745631b5f6517c4a9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IDRSOLIVEGCCHHVWJW6LO44FUF","target":"graph","payload":{"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"},"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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QT/nLykhBG+/hZZMhNia6LPcS4z/O1Xel4y15xAz9R7oEKz4BIobxxcwQlPyHvNYf6hO+VRhbaHBYRTV2POCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:50:22.737357Z"},"content_sha256":"2693bc2c67698cb368d98c3de28e51dc5e8dc9c5ce1089f489e0cfae052c1e15","schema_version":"1.0","event_id":"sha256:2693bc2c67698cb368d98c3de28e51dc5e8dc9c5ce1089f489e0cfae052c1e15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/bundle.json","state_url":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/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-05-26T14:50:22Z","links":{"resolver":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF","bundle":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/bundle.json","state":"https://pith.science/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDRSOLIVEGCCHHVWJW6LO44FUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IDRSOLIVEGCCHHVWJW6LO44FUF","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":"a3693378ab9d33fbabdcf8624114e893b469b317606caa78eb3b24be9ed143d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-04T22:01:59Z","title_canon_sha256":"a9c811a427d1639f60beb30a72c24a8b760fe583ae8fbc24d9c97a2b82b75176"},"schema_version":"1.0","source":{"id":"1408.0828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0828","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0828v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0828","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"IDRSOLIVEGCC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDRSOLIVEGCCHHVW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDRSOLIV","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:2693bc2c67698cb368d98c3de28e51dc5e8dc9c5ce1089f489e0cfae052c1e15","target":"graph","created_at":"2026-05-18T02:45:50Z","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":"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","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-04T22:01:59Z","title":"Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0828","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:3465e09acf89565494a98d8c788d4ff466f772e3635f6a745631b5f6517c4a9f","target":"record","created_at":"2026-05-18T02:45:50Z","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":"a3693378ab9d33fbabdcf8624114e893b469b317606caa78eb3b24be9ed143d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-04T22:01:59Z","title_canon_sha256":"a9c811a427d1639f60beb30a72c24a8b760fe583ae8fbc24d9c97a2b82b75176"},"schema_version":"1.0","source":{"id":"1408.0828","kind":"arxiv","version":1}},"canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40e3272d152184239eb64dbcb77385a15e288b9d94c1a6e74ea39f716057e472","first_computed_at":"2026-05-18T02:45:50.307976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.307976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HtP+Tmr/QRyrJQbnQDGoaooC02U3pZB10pUDJtNJ9PnJL+8sZXTAHAgK24Yby11mZdLYoAbvxb0/HTRRmWT/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.308600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3465e09acf89565494a98d8c788d4ff466f772e3635f6a745631b5f6517c4a9f","sha256:2693bc2c67698cb368d98c3de28e51dc5e8dc9c5ce1089f489e0cfae052c1e15"],"state_sha256":"60774bd63fa820af5310a54c86f671f56c2279d1a01c4955fcd9fadb629395f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Lrn7xJkP98dKbD2yaXgRFMSkazAsqyvWEnqe19NcoGzmbukSthsIf2dErcOekDZ1Jr91awJsnGBPf1idW44DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:50:22.739906Z","bundle_sha256":"7b9905827338c7c775379c6b42b78c141f2029f4b0b2b0d28d562477d6010317"}}