{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:33AG3Y5GXVT3HWGX5EKX4XJBR2","short_pith_number":"pith:33AG3Y5G","schema_version":"1.0","canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","source":{"kind":"arxiv","id":"1604.08775","version":1},"attestation_state":"computed","paper":{"title":"Helly $\\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Liliana Alc\\'on, Mar\\'ia P\\'ia Mazzoleni, Marisa Gutierrez","submitted_at":"2016-04-29T11:11:22Z","abstract_excerpt":"The edge intersection graph of a family of paths in host tree is called an $EPT$ graph. When the host tree has maximum degree $h$, we say that $G$ belongs to the class $[h,2,2]$. If, in addition, the family of paths satisfies the Helly property, then $G \\in$ Helly $[h,2,2]$.\n  The time complexity of the recognition of the classes\n  $[h,2,2]$ inside the class $EPT$ is open for every $h> 4$. Golumbic et al. wonder if the only obstructions for an $EPT$ graph belonging to $[h,2,2]$ are the chordless cycles $C_n$ for $n> h$. In the present paper, we give a negative answer to that question, we prese"},"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":"1604.08775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T11:11:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ad7f428b3f58abe77a31dd38c2862979e3312c482cf0e2e0bdc23f98c00f9c59","abstract_canon_sha256":"94b368c8933bf8212174cf881284387a717adf6d2b18dd49b3cdc0877a7072df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:01.814385Z","signature_b64":"s4EaS/pA72kOlzqRXCNOd6n4+nyOAJknY4CGX27Y7T9fBEpV/zLLcDURCs4AtBX8wrU+D9NfrQxtNPv/c0RBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","last_reissued_at":"2026-05-18T01:16:01.813637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:01.813637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Helly $\\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Liliana Alc\\'on, Mar\\'ia P\\'ia Mazzoleni, Marisa Gutierrez","submitted_at":"2016-04-29T11:11:22Z","abstract_excerpt":"The edge intersection graph of a family of paths in host tree is called an $EPT$ graph. When the host tree has maximum degree $h$, we say that $G$ belongs to the class $[h,2,2]$. If, in addition, the family of paths satisfies the Helly property, then $G \\in$ Helly $[h,2,2]$.\n  The time complexity of the recognition of the classes\n  $[h,2,2]$ inside the class $EPT$ is open for every $h> 4$. Golumbic et al. wonder if the only obstructions for an $EPT$ graph belonging to $[h,2,2]$ are the chordless cycles $C_n$ for $n> h$. In the present paper, we give a negative answer to that question, we prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08775","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08775","created_at":"2026-05-18T01:16:01.813752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08775v1","created_at":"2026-05-18T01:16:01.813752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08775","created_at":"2026-05-18T01:16:01.813752+00:00"},{"alias_kind":"pith_short_12","alias_value":"33AG3Y5GXVT3","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"33AG3Y5GXVT3HWGX","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"33AG3Y5G","created_at":"2026-05-18T12:29:55.572404+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/33AG3Y5GXVT3HWGX5EKX4XJBR2","json":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2.json","graph_json":"https://pith.science/api/pith-number/33AG3Y5GXVT3HWGX5EKX4XJBR2/graph.json","events_json":"https://pith.science/api/pith-number/33AG3Y5GXVT3HWGX5EKX4XJBR2/events.json","paper":"https://pith.science/paper/33AG3Y5G"},"agent_actions":{"view_html":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2","download_json":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2.json","view_paper":"https://pith.science/paper/33AG3Y5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08775&json=true","fetch_graph":"https://pith.science/api/pith-number/33AG3Y5GXVT3HWGX5EKX4XJBR2/graph.json","fetch_events":"https://pith.science/api/pith-number/33AG3Y5GXVT3HWGX5EKX4XJBR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/action/storage_attestation","attest_author":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/action/author_attestation","sign_citation":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/action/citation_signature","submit_replication":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/action/replication_record"}},"created_at":"2026-05-18T01:16:01.813752+00:00","updated_at":"2026-05-18T01:16:01.813752+00:00"}