{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E3BY2IEQ3OAHFS37TYVPVF232H","short_pith_number":"pith:E3BY2IEQ","canonical_record":{"source":{"id":"1411.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-11T19:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"0a5a69460f366df7c5f5383ebb202b140691a43e2377d2fc0609ae482fdc6ca6","abstract_canon_sha256":"cfca0f5b1029198cb6ba3f8ea046d8f4cc494ce27c5557030108ead1685b745a"},"schema_version":"1.0"},"canonical_sha256":"26c38d2090db8072cb7f9e2afa975bd1e2d9e13422748dbda3db1dc769f1716d","source":{"kind":"arxiv","id":"1411.2928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2928","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2928v2","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2928","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"E3BY2IEQ3OAH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E3BY2IEQ3OAHFS37","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E3BY2IEQ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E3BY2IEQ3OAHFS37TYVPVF232H","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-11T19:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"0a5a69460f366df7c5f5383ebb202b140691a43e2377d2fc0609ae482fdc6ca6","abstract_canon_sha256":"cfca0f5b1029198cb6ba3f8ea046d8f4cc494ce27c5557030108ead1685b745a"},"schema_version":"1.0"},"canonical_sha256":"26c38d2090db8072cb7f9e2afa975bd1e2d9e13422748dbda3db1dc769f1716d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:27.933871Z","signature_b64":"NCt8+ZztP5QvvH/WT2teuwtRQm3wI0QtpC3qwus0I90/qz/kSsq9oC97IPHQDcGxm1Va4jJ462O66wC+VC+hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c38d2090db8072cb7f9e2afa975bd1e2d9e13422748dbda3db1dc769f1716d","last_reissued_at":"2026-05-18T00:59:27.933202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:27.933202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2928","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-18T00:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKLK3gIb5a4V+H8H/hvjEQdp6QIHIAphDoGI/x8L1ZIuWSX4adnN2lSkESfZ/KCD9eJ5HiJQRQkk+pAVQjGjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:27:40.214117Z"},"content_sha256":"668778fe331c59d16bd544ff157715c8f849248c4bcfc4a52f0086cc54a83427","schema_version":"1.0","event_id":"sha256:668778fe331c59d16bd544ff157715c8f849248c4bcfc4a52f0086cc54a83427"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E3BY2IEQ3OAHFS37TYVPVF232H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan Kratochv\\'il, Joshua Terhaar, Konstanty Junosza-Szaniawski, Martin Pergel, Matthew Szczepankiewicz, Pawe{\\l} Rz\\k{a}\\.zewski, Sean Kafer, Valentin E. Brimkov","submitted_at":"2014-11-11T19:14:19Z","abstract_excerpt":"We study the {\\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straight-line-segment intersection graphs, but solvable in polynomial time in intersection graphs of homothetic triangles. We extend the latter result by showing that for every convex polygon $P$ with sides parallel to $k$ directions, every $n$-vertex graph which is an intersection graph of homothetic copies of $P$ contains at most $n^{k}$ inclusion-wise maximal cliques. We actually prove this result for a more general cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2928","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-18T00:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edvrkNYJX4BM3+RZB9ZAv0YnpOCImgFmXlUMDWjuJ7i2IziF3zz0qvsEX3EM/BcMdBweQY/oFHoBuxtnRI51DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:27:40.214493Z"},"content_sha256":"8612bef6e14c3768763cbe575d0b153396e4ef81df7f8c055f6789fc5649e63a","schema_version":"1.0","event_id":"sha256:8612bef6e14c3768763cbe575d0b153396e4ef81df7f8c055f6789fc5649e63a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3BY2IEQ3OAHFS37TYVPVF232H/bundle.json","state_url":"https://pith.science/pith/E3BY2IEQ3OAHFS37TYVPVF232H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3BY2IEQ3OAHFS37TYVPVF232H/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-28T01:27:40Z","links":{"resolver":"https://pith.science/pith/E3BY2IEQ3OAHFS37TYVPVF232H","bundle":"https://pith.science/pith/E3BY2IEQ3OAHFS37TYVPVF232H/bundle.json","state":"https://pith.science/pith/E3BY2IEQ3OAHFS37TYVPVF232H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3BY2IEQ3OAHFS37TYVPVF232H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E3BY2IEQ3OAHFS37TYVPVF232H","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":"cfca0f5b1029198cb6ba3f8ea046d8f4cc494ce27c5557030108ead1685b745a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-11T19:14:19Z","title_canon_sha256":"0a5a69460f366df7c5f5383ebb202b140691a43e2377d2fc0609ae482fdc6ca6"},"schema_version":"1.0","source":{"id":"1411.2928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2928","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2928v2","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2928","created_at":"2026-05-18T00:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"E3BY2IEQ3OAH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E3BY2IEQ3OAHFS37","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E3BY2IEQ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:8612bef6e14c3768763cbe575d0b153396e4ef81df7f8c055f6789fc5649e63a","target":"graph","created_at":"2026-05-18T00:59:27Z","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":"We study the {\\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straight-line-segment intersection graphs, but solvable in polynomial time in intersection graphs of homothetic triangles. We extend the latter result by showing that for every convex polygon $P$ with sides parallel to $k$ directions, every $n$-vertex graph which is an intersection graph of homothetic copies of $P$ contains at most $n^{k}$ inclusion-wise maximal cliques. We actually prove this result for a more general cla","authors_text":"Jan Kratochv\\'il, Joshua Terhaar, Konstanty Junosza-Szaniawski, Martin Pergel, Matthew Szczepankiewicz, Pawe{\\l} Rz\\k{a}\\.zewski, Sean Kafer, Valentin E. Brimkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-11T19:14:19Z","title":"Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2928","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:668778fe331c59d16bd544ff157715c8f849248c4bcfc4a52f0086cc54a83427","target":"record","created_at":"2026-05-18T00:59:27Z","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":"cfca0f5b1029198cb6ba3f8ea046d8f4cc494ce27c5557030108ead1685b745a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-11T19:14:19Z","title_canon_sha256":"0a5a69460f366df7c5f5383ebb202b140691a43e2377d2fc0609ae482fdc6ca6"},"schema_version":"1.0","source":{"id":"1411.2928","kind":"arxiv","version":2}},"canonical_sha256":"26c38d2090db8072cb7f9e2afa975bd1e2d9e13422748dbda3db1dc769f1716d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26c38d2090db8072cb7f9e2afa975bd1e2d9e13422748dbda3db1dc769f1716d","first_computed_at":"2026-05-18T00:59:27.933202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:27.933202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NCt8+ZztP5QvvH/WT2teuwtRQm3wI0QtpC3qwus0I90/qz/kSsq9oC97IPHQDcGxm1Va4jJ462O66wC+VC+hDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:27.933871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:668778fe331c59d16bd544ff157715c8f849248c4bcfc4a52f0086cc54a83427","sha256:8612bef6e14c3768763cbe575d0b153396e4ef81df7f8c055f6789fc5649e63a"],"state_sha256":"c2229c2a9266735777b3dd301cc737ad1a9c51df5f6c39a87a616dbcd977b90f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B63oK1YgdElMrbpn82ssq02NE0vN3YNOFiMbnZDV91zrjgIzzfQow3M7YBDW2c7ysAQJ9wo471m3dqd5uoR8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:27:40.217005Z","bundle_sha256":"22b84d8cbc01d86f85db76844d2a262a59c84513b631be82aa216a06d3441241"}}