{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RLR3Y733OGYWEGJRCGUIN5FJDA","short_pith_number":"pith:RLR3Y733","schema_version":"1.0","canonical_sha256":"8ae3bc7f7b71b162193111a886f4a91835d5546aa9dfcf8146ed3862cc463091","source":{"kind":"arxiv","id":"2606.08338","version":1},"attestation_state":"computed","paper":{"title":"Discrete-time treatment number of binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ann N. Trenk, Karen L. Collins, Margaret-Ellen Messinger","submitted_at":"2026-06-06T21:03:54Z","abstract_excerpt":"The discrete-time treatment number of a graph $H$, denoted by $\\tau(H)$, was introduced in arXiv:2408.0531(3) and arises from a deterministic process in which each vertex is assigned a color at each time-step. The pathwidth upper bound $\\tau(H)\\leq \\lceil\\frac{1+pw(H)}{2}\\rceil$, is shown in arXiv:2408.0531(3), where $pw(H)$ denotes the pathwidth of graph $H$. Equality holds when $H$ is the complete binary tree of depth $d$ (denoted by $BT(d)$) and $1 \\le d \\le 6$. In this paper, we characterize the sizes of all subsets of vertices of $BT(d)$ whose boundary has $3$ or fewer vertices and use th"},"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":"2606.08338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-06T21:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"2b1721bf7544d6abc86c92f01dab873300b14a4bc6731e0d142919f64bf0af04","abstract_canon_sha256":"caef960aa16130d7fe74b0064b11f19e978d3554ca2b2f23c176b93d69246058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:33.956543Z","signature_b64":"vaCzMDAlGS9vv4KkjwwQV1sWuwP5qqaNvH6yG/JLElpeprHEUBS2VaYhhVXNJ8AauVJYQL9bXLkKLJX/M76pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae3bc7f7b71b162193111a886f4a91835d5546aa9dfcf8146ed3862cc463091","last_reissued_at":"2026-06-09T01:05:33.956112Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:33.956112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete-time treatment number of binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ann N. Trenk, Karen L. Collins, Margaret-Ellen Messinger","submitted_at":"2026-06-06T21:03:54Z","abstract_excerpt":"The discrete-time treatment number of a graph $H$, denoted by $\\tau(H)$, was introduced in arXiv:2408.0531(3) and arises from a deterministic process in which each vertex is assigned a color at each time-step. The pathwidth upper bound $\\tau(H)\\leq \\lceil\\frac{1+pw(H)}{2}\\rceil$, is shown in arXiv:2408.0531(3), where $pw(H)$ denotes the pathwidth of graph $H$. Equality holds when $H$ is the complete binary tree of depth $d$ (denoted by $BT(d)$) and $1 \\le d \\le 6$. In this paper, we characterize the sizes of all subsets of vertices of $BT(d)$ whose boundary has $3$ or fewer vertices and use th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08338","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.08338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.08338","created_at":"2026-06-09T01:05:33.956177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08338v1","created_at":"2026-06-09T01:05:33.956177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08338","created_at":"2026-06-09T01:05:33.956177+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLR3Y733OGYW","created_at":"2026-06-09T01:05:33.956177+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLR3Y733OGYWEGJR","created_at":"2026-06-09T01:05:33.956177+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLR3Y733","created_at":"2026-06-09T01:05:33.956177+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/RLR3Y733OGYWEGJRCGUIN5FJDA","json":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA.json","graph_json":"https://pith.science/api/pith-number/RLR3Y733OGYWEGJRCGUIN5FJDA/graph.json","events_json":"https://pith.science/api/pith-number/RLR3Y733OGYWEGJRCGUIN5FJDA/events.json","paper":"https://pith.science/paper/RLR3Y733"},"agent_actions":{"view_html":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA","download_json":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA.json","view_paper":"https://pith.science/paper/RLR3Y733","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08338&json=true","fetch_graph":"https://pith.science/api/pith-number/RLR3Y733OGYWEGJRCGUIN5FJDA/graph.json","fetch_events":"https://pith.science/api/pith-number/RLR3Y733OGYWEGJRCGUIN5FJDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA/action/storage_attestation","attest_author":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA/action/author_attestation","sign_citation":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA/action/citation_signature","submit_replication":"https://pith.science/pith/RLR3Y733OGYWEGJRCGUIN5FJDA/action/replication_record"}},"created_at":"2026-06-09T01:05:33.956177+00:00","updated_at":"2026-06-09T01:05:33.956177+00:00"}