{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:33AG3Y5GXVT3HWGX5EKX4XJBR2","short_pith_number":"pith:33AG3Y5G","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"},"canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","source":{"kind":"arxiv","id":"1604.08775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08775","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08775v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08775","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"33AG3Y5GXVT3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33AG3Y5GXVT3HWGX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33AG3Y5G","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:33AG3Y5GXVT3HWGX5EKX4XJBR2","target":"record","payload":{"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"},"canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","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"},"source_kind":"arxiv","source_id":"1604.08775","source_version":1,"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-18T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOKt3wWNJwE4dJC4zqgM0PCX+X+grcx61DWt0tNpH3doRHD0bcCQDnDCCb+zeRVW1i947YTXEiSdLN0i07FSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:52:39.655500Z"},"content_sha256":"35d946d02c836ae7462a98406f38595ec070ccc769035270a64b68c0957f19ef","schema_version":"1.0","event_id":"sha256:35d946d02c836ae7462a98406f38595ec070ccc769035270a64b68c0957f19ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:33AG3Y5GXVT3HWGX5EKX4XJBR2","target":"graph","payload":{"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"},"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-18T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjoRLSO75qH8W1viLHBrG9XE+8/NpLEM9NvcqeNaolOFboPuEJkfnOeai3fIf+4d9sVLg+B/EsrUwsc0E7j7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:52:39.656179Z"},"content_sha256":"c40afe765a4678dbd749ff8ec296e04d1be6a2740f5ee798591976e126e6dc35","schema_version":"1.0","event_id":"sha256:c40afe765a4678dbd749ff8ec296e04d1be6a2740f5ee798591976e126e6dc35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/bundle.json","state_url":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/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-06-05T17:52:39Z","links":{"resolver":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2","bundle":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/bundle.json","state":"https://pith.science/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33AG3Y5GXVT3HWGX5EKX4XJBR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:33AG3Y5GXVT3HWGX5EKX4XJBR2","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":"94b368c8933bf8212174cf881284387a717adf6d2b18dd49b3cdc0877a7072df","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T11:11:22Z","title_canon_sha256":"ad7f428b3f58abe77a31dd38c2862979e3312c482cf0e2e0bdc23f98c00f9c59"},"schema_version":"1.0","source":{"id":"1604.08775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08775","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08775v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08775","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"33AG3Y5GXVT3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33AG3Y5GXVT3HWGX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33AG3Y5G","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:c40afe765a4678dbd749ff8ec296e04d1be6a2740f5ee798591976e126e6dc35","target":"graph","created_at":"2026-05-18T01:16:01Z","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":"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","authors_text":"Liliana Alc\\'on, Mar\\'ia P\\'ia Mazzoleni, Marisa Gutierrez","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T11:11:22Z","title":"Helly $\\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08775","kind":"arxiv","version":1},"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:35d946d02c836ae7462a98406f38595ec070ccc769035270a64b68c0957f19ef","target":"record","created_at":"2026-05-18T01:16:01Z","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":"94b368c8933bf8212174cf881284387a717adf6d2b18dd49b3cdc0877a7072df","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T11:11:22Z","title_canon_sha256":"ad7f428b3f58abe77a31dd38c2862979e3312c482cf0e2e0bdc23f98c00f9c59"},"schema_version":"1.0","source":{"id":"1604.08775","kind":"arxiv","version":1}},"canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dec06de3a6bd67b3d8d7e9157e5d218ebb5c0246ed1cb5470c24d99a6cc37360","first_computed_at":"2026-05-18T01:16:01.813637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:01.813637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4EaS/pA72kOlzqRXCNOd6n4+nyOAJknY4CGX27Y7T9fBEpV/zLLcDURCs4AtBX8wrU+D9NfrQxtNPv/c0RBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:01.814385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d946d02c836ae7462a98406f38595ec070ccc769035270a64b68c0957f19ef","sha256:c40afe765a4678dbd749ff8ec296e04d1be6a2740f5ee798591976e126e6dc35"],"state_sha256":"b596b80c8df520e7393a040b42e82a09e967d5de5d119036ec36c5ce632c5197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEFJnqdFhTWt20lNEfpF5FCS8LyIAfsWp4VhbJn6ynAluHAAr3HLrbfV6UAkRXDc6yDitYlx0Fi0UIm43BhrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:52:39.659942Z","bundle_sha256":"f68be6c86a0fbe829d2be055498a70d055626b387345b0d34f081332ce8f0010"}}