{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KPY5SZ2SPGEIRF7IWUBMUVSLDE","short_pith_number":"pith:KPY5SZ2S","canonical_record":{"source":{"id":"1212.4129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T20:38:28Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"cae1ad2addf7cb8fa920ac325eff44a8ad38dba80de1c204d2a14f5369b5cc0a","abstract_canon_sha256":"71360493a0d73da49acb9c3b951dc08b5d952bd663599dc0b987d000e3dc107b"},"schema_version":"1.0"},"canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","source":{"kind":"arxiv","id":"1212.4129","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4129","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4129v2","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4129","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"KPY5SZ2SPGEI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KPY5SZ2SPGEIRF7I","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KPY5SZ2S","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KPY5SZ2SPGEIRF7IWUBMUVSLDE","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T20:38:28Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"cae1ad2addf7cb8fa920ac325eff44a8ad38dba80de1c204d2a14f5369b5cc0a","abstract_canon_sha256":"71360493a0d73da49acb9c3b951dc08b5d952bd663599dc0b987d000e3dc107b"},"schema_version":"1.0"},"canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:54.372126Z","signature_b64":"AFTv+vGrZK2tsg/IUpCa09kmAp9qiiAYgroVBrVGPRkl96nOuvcbtASWUaTsyblc12u1y0HJYDPtX17fidwxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","last_reissued_at":"2026-05-18T02:39:54.371705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:54.371705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4129","source_version":2,"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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"650mEX3EKhQGwssPSAFFlOY5tR4mdFBAyVcXIIqc2vdk0cI7cXvao/g75wSnBtJHfYobaVuSMfe0lzxEfS6BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:33.985789Z"},"content_sha256":"459b6e852b0781188d96d6356f5b764dd1ede8210fc632bb45a2b155ec3b4909","schema_version":"1.0","event_id":"sha256:459b6e852b0781188d96d6356f5b764dd1ede8210fc632bb45a2b155ec3b4909"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KPY5SZ2SPGEIRF7IWUBMUVSLDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","submitted_at":"2012-12-17T20:38:28Z","abstract_excerpt":"Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form $f(G*H)$ where $G$ and $H$ are graphs, * is a graph product and $f$ is a graph property. For example, if $f$ is the independence number and * is the disjunctive product, then the product is known to be multiplicative: $f(G*H)=f(G)f(H)$.\n  In this paper, we study graph products in the following non-standard form: $f((G\\oplus H)*J)$ where $G$, $H$ and $J$ are graphs, $\\oplus$ and * are two different graph products and $f$ is a graph property. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4129","kind":"arxiv","version":2},"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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N033UJMrKUJ8xb2saOpxAvJZ8v+h4q5kwdDDcTnnWMK8W2Aj9C42bEfuVbenb9RcDCs6C5M3gmK+mD+ZDstBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:33.986164Z"},"content_sha256":"7513787d96081acfef4ad059e20795a4ab04e70e8db040ca82535b3d3802c962","schema_version":"1.0","event_id":"sha256:7513787d96081acfef4ad059e20795a4ab04e70e8db040ca82535b3d3802c962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/bundle.json","state_url":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/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-25T16:39:33Z","links":{"resolver":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE","bundle":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/bundle.json","state":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KPY5SZ2SPGEIRF7IWUBMUVSLDE","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":"71360493a0d73da49acb9c3b951dc08b5d952bd663599dc0b987d000e3dc107b","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T20:38:28Z","title_canon_sha256":"cae1ad2addf7cb8fa920ac325eff44a8ad38dba80de1c204d2a14f5369b5cc0a"},"schema_version":"1.0","source":{"id":"1212.4129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4129","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4129v2","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4129","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"KPY5SZ2SPGEI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KPY5SZ2SPGEIRF7I","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KPY5SZ2S","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:7513787d96081acfef4ad059e20795a4ab04e70e8db040ca82535b3d3802c962","target":"graph","created_at":"2026-05-18T02:39:54Z","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":"Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form $f(G*H)$ where $G$ and $H$ are graphs, * is a graph product and $f$ is a graph property. For example, if $f$ is the independence number and * is the disjunctive product, then the product is known to be multiplicative: $f(G*H)=f(G)f(H)$.\n  In this paper, we study graph products in the following non-standard form: $f((G\\oplus H)*J)$ where $G$, $H$ and $J$ are graphs, $\\oplus$ and * are two different graph products and $f$ is a graph property. We show","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","cross_cats":["cs.CC","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T20:38:28Z","title":"Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4129","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:459b6e852b0781188d96d6356f5b764dd1ede8210fc632bb45a2b155ec3b4909","target":"record","created_at":"2026-05-18T02:39:54Z","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":"71360493a0d73da49acb9c3b951dc08b5d952bd663599dc0b987d000e3dc107b","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T20:38:28Z","title_canon_sha256":"cae1ad2addf7cb8fa920ac325eff44a8ad38dba80de1c204d2a14f5369b5cc0a"},"schema_version":"1.0","source":{"id":"1212.4129","kind":"arxiv","version":2}},"canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","first_computed_at":"2026-05-18T02:39:54.371705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:54.371705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFTv+vGrZK2tsg/IUpCa09kmAp9qiiAYgroVBrVGPRkl96nOuvcbtASWUaTsyblc12u1y0HJYDPtX17fidwxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:54.372126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459b6e852b0781188d96d6356f5b764dd1ede8210fc632bb45a2b155ec3b4909","sha256:7513787d96081acfef4ad059e20795a4ab04e70e8db040ca82535b3d3802c962"],"state_sha256":"6b2236c3ed0f4b90b0c1142bb951aded6161345b7f633ace4001b88f59ff7542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdEHd4/W2neKeAPmsUeqimlk66Tn+B7A8cvytCMqwmcOOaVR5KQV41Y7SfaMN7J6l18WAAYz2yelfshzgsAhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:39:33.989229Z","bundle_sha256":"d63f89aaa84a78b895a5e97fbdc6f788f3586274ff4f4a3a9d127e5ad43b9590"}}