{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H2DDRCHITCQ55EUQQCGJKI7QLF","short_pith_number":"pith:H2DDRCHI","schema_version":"1.0","canonical_sha256":"3e863888e898a1de9290808c9523f0594d3409b6039d97e0210bd5231f5f7cab","source":{"kind":"arxiv","id":"1309.2898","version":2},"attestation_state":"computed","paper":{"title":"Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arman Boyac{\\i}, Mordechai Shalom, Shmuel Zaks, T{\\i}naz Ekim","submitted_at":"2013-09-11T17:30:59Z","abstract_excerpt":"Given a tree and a set ${\\cal P}$ of non-trivial simple paths on it, $VPT({\\cal P})$ is the VPT graph (i.e. the vertex intersection graph) of the paths ${\\cal P}$ of the tree $T$, and $EPT({\\cal P})$ is the EPT graph (i.e. the edge intersection graph) of ${\\cal P}$. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their \\emph{split vertices} is the set of vertices having degree at least $3$ in their union. A pair of (edge) intersecting paths is termed \\emph{non-splitting} if they do not have split vertices (namely if their union is a"},"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":"1309.2898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T17:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"ae51dd0d0924c119549c9f2e4146575617f25a48d2e15b4a7564151f63090a9e","abstract_canon_sha256":"f6c550df4fee8ea7d505097234f5996661833a609e946dfa130356fe99d1c56c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:05.921236Z","signature_b64":"JQtdteEjqvF42p0tIdDf9dRyOlsoFHrZtV+DUty1Jr/bBpxiJExm8B6RqMSqXzhfnQaUI5VOiFHB3Q65iRA/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e863888e898a1de9290808c9523f0594d3409b6039d97e0210bd5231f5f7cab","last_reissued_at":"2026-05-18T01:37:05.920605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:05.920605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arman Boyac{\\i}, Mordechai Shalom, Shmuel Zaks, T{\\i}naz Ekim","submitted_at":"2013-09-11T17:30:59Z","abstract_excerpt":"Given a tree and a set ${\\cal P}$ of non-trivial simple paths on it, $VPT({\\cal P})$ is the VPT graph (i.e. the vertex intersection graph) of the paths ${\\cal P}$ of the tree $T$, and $EPT({\\cal P})$ is the EPT graph (i.e. the edge intersection graph) of ${\\cal P}$. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their \\emph{split vertices} is the set of vertices having degree at least $3$ in their union. A pair of (edge) intersecting paths is termed \\emph{non-splitting} if they do not have split vertices (namely if their union is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2898","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":"1309.2898","created_at":"2026-05-18T01:37:05.920696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2898v2","created_at":"2026-05-18T01:37:05.920696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2898","created_at":"2026-05-18T01:37:05.920696+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2DDRCHITCQ5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2DDRCHITCQ55EUQ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2DDRCHI","created_at":"2026-05-18T12:27:46.883200+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/H2DDRCHITCQ55EUQQCGJKI7QLF","json":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF.json","graph_json":"https://pith.science/api/pith-number/H2DDRCHITCQ55EUQQCGJKI7QLF/graph.json","events_json":"https://pith.science/api/pith-number/H2DDRCHITCQ55EUQQCGJKI7QLF/events.json","paper":"https://pith.science/paper/H2DDRCHI"},"agent_actions":{"view_html":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF","download_json":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF.json","view_paper":"https://pith.science/paper/H2DDRCHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2898&json=true","fetch_graph":"https://pith.science/api/pith-number/H2DDRCHITCQ55EUQQCGJKI7QLF/graph.json","fetch_events":"https://pith.science/api/pith-number/H2DDRCHITCQ55EUQQCGJKI7QLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF/action/storage_attestation","attest_author":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF/action/author_attestation","sign_citation":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF/action/citation_signature","submit_replication":"https://pith.science/pith/H2DDRCHITCQ55EUQQCGJKI7QLF/action/replication_record"}},"created_at":"2026-05-18T01:37:05.920696+00:00","updated_at":"2026-05-18T01:37:05.920696+00:00"}