{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RSYGIMXH4WAUIUAYY42FY4MJDY","short_pith_number":"pith:RSYGIMXH","schema_version":"1.0","canonical_sha256":"8cb06432e7e581445018c7345c71891e33cb661ea994b2331256d21124963872","source":{"kind":"arxiv","id":"1703.08465","version":1},"attestation_state":"computed","paper":{"title":"Constant Threshold Intersection Graphs of Orthodox Paths in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claudson Ferreira Bornstein, Dieter Rautenbach, Jayme Luiz Szwarcfiter, Jos\\'e Wilson Coura Pinto","submitted_at":"2017-03-24T15:35:22Z","abstract_excerpt":"A graph $G$ belongs to the class ${\\rm ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,{\\cal S})$, where $T$ is a tree of maximum degree at most $h$, and ${\\cal S}$ is a collection $(S_u)_{u\\in V(G)}$ of subtrees $S_u$ of maximum degree at most $s$ of $T$, one for each vertex $u$ of $G$, such that, for every vertex $u$ of $G$, all leaves of $S_u$ are also leaves of $T$, and, for every two distinct vertices $u$ and $v$ of $G$, the following three properties are equivalent:\n  (i) $u$ and $v$ are adjacent.\n  (ii) $S_u$ and $S_v$ have at least $t$ vertices in common.\n  (iii) $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":"1703.08465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-24T15:35:22Z","cross_cats_sorted":[],"title_canon_sha256":"5b0c8a61f7591cbf2c0515859aed49a0dd493bfe28dba3d1330bef32b6d57c30","abstract_canon_sha256":"1cf941eff0c51f3120110da306277493a2e3352773c54f9c669588d5e71df4ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.889445Z","signature_b64":"wWrxaOOzmHpcT3BlcWCRAI5dLuaaNpwXy/BK8kX7Vm6bb2bMdiCOd9j43H5MzDDi5Tkr1QHge8WRyICg8USPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb06432e7e581445018c7345c71891e33cb661ea994b2331256d21124963872","last_reissued_at":"2026-05-18T00:47:59.888883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.888883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Threshold Intersection Graphs of Orthodox Paths in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claudson Ferreira Bornstein, Dieter Rautenbach, Jayme Luiz Szwarcfiter, Jos\\'e Wilson Coura Pinto","submitted_at":"2017-03-24T15:35:22Z","abstract_excerpt":"A graph $G$ belongs to the class ${\\rm ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,{\\cal S})$, where $T$ is a tree of maximum degree at most $h$, and ${\\cal S}$ is a collection $(S_u)_{u\\in V(G)}$ of subtrees $S_u$ of maximum degree at most $s$ of $T$, one for each vertex $u$ of $G$, such that, for every vertex $u$ of $G$, all leaves of $S_u$ are also leaves of $T$, and, for every two distinct vertices $u$ and $v$ of $G$, the following three properties are equivalent:\n  (i) $u$ and $v$ are adjacent.\n  (ii) $S_u$ and $S_v$ have at least $t$ vertices in common.\n  (iii) $S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08465","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":"1703.08465","created_at":"2026-05-18T00:47:59.888950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08465v1","created_at":"2026-05-18T00:47:59.888950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08465","created_at":"2026-05-18T00:47:59.888950+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSYGIMXH4WAU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSYGIMXH4WAUIUAY","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSYGIMXH","created_at":"2026-05-18T12:31:39.905425+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/RSYGIMXH4WAUIUAYY42FY4MJDY","json":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY.json","graph_json":"https://pith.science/api/pith-number/RSYGIMXH4WAUIUAYY42FY4MJDY/graph.json","events_json":"https://pith.science/api/pith-number/RSYGIMXH4WAUIUAYY42FY4MJDY/events.json","paper":"https://pith.science/paper/RSYGIMXH"},"agent_actions":{"view_html":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY","download_json":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY.json","view_paper":"https://pith.science/paper/RSYGIMXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08465&json=true","fetch_graph":"https://pith.science/api/pith-number/RSYGIMXH4WAUIUAYY42FY4MJDY/graph.json","fetch_events":"https://pith.science/api/pith-number/RSYGIMXH4WAUIUAYY42FY4MJDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY/action/storage_attestation","attest_author":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY/action/author_attestation","sign_citation":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY/action/citation_signature","submit_replication":"https://pith.science/pith/RSYGIMXH4WAUIUAYY42FY4MJDY/action/replication_record"}},"created_at":"2026-05-18T00:47:59.888950+00:00","updated_at":"2026-05-18T00:47:59.888950+00:00"}