{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KPY5SZ2SPGEIRF7IWUBMUVSLDE","short_pith_number":"pith:KPY5SZ2S","schema_version":"1.0","canonical_sha256":"53f1d9675279888897e8b502ca564b19219c70efa317240fd857513da8db0c06","source":{"kind":"arxiv","id":"1212.4129","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.4129","created_at":"2026-05-18T02:39:54.371770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4129v2","created_at":"2026-05-18T02:39:54.371770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4129","created_at":"2026-05-18T02:39:54.371770+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPY5SZ2SPGEI","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPY5SZ2SPGEIRF7I","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPY5SZ2S","created_at":"2026-05-18T12:27:11.947152+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/KPY5SZ2SPGEIRF7IWUBMUVSLDE","json":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE.json","graph_json":"https://pith.science/api/pith-number/KPY5SZ2SPGEIRF7IWUBMUVSLDE/graph.json","events_json":"https://pith.science/api/pith-number/KPY5SZ2SPGEIRF7IWUBMUVSLDE/events.json","paper":"https://pith.science/paper/KPY5SZ2S"},"agent_actions":{"view_html":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE","download_json":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE.json","view_paper":"https://pith.science/paper/KPY5SZ2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4129&json=true","fetch_graph":"https://pith.science/api/pith-number/KPY5SZ2SPGEIRF7IWUBMUVSLDE/graph.json","fetch_events":"https://pith.science/api/pith-number/KPY5SZ2SPGEIRF7IWUBMUVSLDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/action/storage_attestation","attest_author":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/action/author_attestation","sign_citation":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/action/citation_signature","submit_replication":"https://pith.science/pith/KPY5SZ2SPGEIRF7IWUBMUVSLDE/action/replication_record"}},"created_at":"2026-05-18T02:39:54.371770+00:00","updated_at":"2026-05-18T02:39:54.371770+00:00"}