{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TTBSRXIPCL6JJSHCHVDRFMDA5L","short_pith_number":"pith:TTBSRXIP","schema_version":"1.0","canonical_sha256":"9cc328dd0f12fc94c8e23d4712b060eaf8199d21adc1e99b83b09b8ad2f59579","source":{"kind":"arxiv","id":"1603.08974","version":2},"attestation_state":"computed","paper":{"title":"Refining the Hierarchies of Classes of Geometric Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miha Jej\\v{c}i\\v{c}, Sergio Cabello","submitted_at":"2016-03-29T21:29:27Z","abstract_excerpt":"We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties:\n  - A graph $G$ is outerplanar if and only if the 1-subdivision of $G$ is outer-segment.\n  - For each integer $k\\ge 1$, the class of intersection graphs of segments with $k$ different lengths is a strict subclass of the class of intersection graphs of segments with $k+1$ different lengths.\n  - For each integer $k\\ge 1$, the class of intersection graphs of disks with $k$ different sizes is a strict s"},"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":"1603.08974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-29T21:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"1432abbc3fc06302b3c47c987d45ba7276450725ec8c0ad8d4af10c597ec13fc","abstract_canon_sha256":"4c5bfa030cf528accfcc27ce231c607a6b7ac595c5ff02ddf4741a439f45e7ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:37.451779Z","signature_b64":"+5zkjYgeaQydkxRORKw21zY4Gw2/FDsUcxBSn3u3jRqGiLgq8rGXxK2PRBN7YzQo5Xep+Oj2iLHC114Z8y0CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc328dd0f12fc94c8e23d4712b060eaf8199d21adc1e99b83b09b8ad2f59579","last_reissued_at":"2026-05-18T00:51:37.451420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:37.451420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refining the Hierarchies of Classes of Geometric Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miha Jej\\v{c}i\\v{c}, Sergio Cabello","submitted_at":"2016-03-29T21:29:27Z","abstract_excerpt":"We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties:\n  - A graph $G$ is outerplanar if and only if the 1-subdivision of $G$ is outer-segment.\n  - For each integer $k\\ge 1$, the class of intersection graphs of segments with $k$ different lengths is a strict subclass of the class of intersection graphs of segments with $k+1$ different lengths.\n  - For each integer $k\\ge 1$, the class of intersection graphs of disks with $k$ different sizes is a strict s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08974","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":"1603.08974","created_at":"2026-05-18T00:51:37.451479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08974v2","created_at":"2026-05-18T00:51:37.451479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08974","created_at":"2026-05-18T00:51:37.451479+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTBSRXIPCL6J","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTBSRXIPCL6JJSHC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTBSRXIP","created_at":"2026-05-18T12:30:46.583412+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/TTBSRXIPCL6JJSHCHVDRFMDA5L","json":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L.json","graph_json":"https://pith.science/api/pith-number/TTBSRXIPCL6JJSHCHVDRFMDA5L/graph.json","events_json":"https://pith.science/api/pith-number/TTBSRXIPCL6JJSHCHVDRFMDA5L/events.json","paper":"https://pith.science/paper/TTBSRXIP"},"agent_actions":{"view_html":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L","download_json":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L.json","view_paper":"https://pith.science/paper/TTBSRXIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08974&json=true","fetch_graph":"https://pith.science/api/pith-number/TTBSRXIPCL6JJSHCHVDRFMDA5L/graph.json","fetch_events":"https://pith.science/api/pith-number/TTBSRXIPCL6JJSHCHVDRFMDA5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L/action/storage_attestation","attest_author":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L/action/author_attestation","sign_citation":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L/action/citation_signature","submit_replication":"https://pith.science/pith/TTBSRXIPCL6JJSHCHVDRFMDA5L/action/replication_record"}},"created_at":"2026-05-18T00:51:37.451479+00:00","updated_at":"2026-05-18T00:51:37.451479+00:00"}