{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RKCB5VFPNH4KVODYJT2OEWRGBO","short_pith_number":"pith:RKCB5VFP","schema_version":"1.0","canonical_sha256":"8a841ed4af69f8aab8784cf4e25a260b8a0cf1eb50a0e3e9cb92c98bd31465cf","source":{"kind":"arxiv","id":"1412.5733","version":1},"attestation_state":"computed","paper":{"title":"A note on the Brush Number of Jaco Graphs, $J_n(1), n \\in \\Bbb N","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok","submitted_at":"2014-12-18T06:41:21Z","abstract_excerpt":"The concept of the brush number $b_r(G)$ was introduced for a simple connected undirected graph $G$. This note extends the concept to a special family of directed graphs and declares that the brush number $b_r(J_n(1))$ of a finite Jaco graph, $J_n(1), n \\in \\Bbb N$ with prime Jaconian vertex $v_i$ is given by:\\\\ \\\\ $b_r(J_n(1)) = \\sum\\limits_{j=1}^{I}(d^+(v_j) - d^-(v_j)) + \\sum\\limits_{j=I+1}^{n}max\\{0, (n-j) - d^-(v_j)\\}."},"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":"1412.5733","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T06:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"406f707b817454aa3002eb12a8e7317d2d6749788697989dce4d235c206d476f","abstract_canon_sha256":"08eb431b007d063c5d25352ec895254987453c51d9f8f84589e2c861baa4652d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.483462Z","signature_b64":"h8vCQiSO7DliqWPT/tZgNMsueCvuEu3j3olPueUX1PdL/UxsI+zCS3r+s+TgKMpd+jFAoCEqlZO8XddW9tazBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a841ed4af69f8aab8784cf4e25a260b8a0cf1eb50a0e3e9cb92c98bd31465cf","last_reissued_at":"2026-05-18T02:31:01.482976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.482976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the Brush Number of Jaco Graphs, $J_n(1), n \\in \\Bbb N","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok","submitted_at":"2014-12-18T06:41:21Z","abstract_excerpt":"The concept of the brush number $b_r(G)$ was introduced for a simple connected undirected graph $G$. This note extends the concept to a special family of directed graphs and declares that the brush number $b_r(J_n(1))$ of a finite Jaco graph, $J_n(1), n \\in \\Bbb N$ with prime Jaconian vertex $v_i$ is given by:\\\\ \\\\ $b_r(J_n(1)) = \\sum\\limits_{j=1}^{I}(d^+(v_j) - d^-(v_j)) + \\sum\\limits_{j=I+1}^{n}max\\{0, (n-j) - d^-(v_j)\\}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5733","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":"1412.5733","created_at":"2026-05-18T02:31:01.483033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5733v1","created_at":"2026-05-18T02:31:01.483033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5733","created_at":"2026-05-18T02:31:01.483033+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKCB5VFPNH4K","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKCB5VFPNH4KVODY","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKCB5VFP","created_at":"2026-05-18T12:28:46.137349+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/RKCB5VFPNH4KVODYJT2OEWRGBO","json":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO.json","graph_json":"https://pith.science/api/pith-number/RKCB5VFPNH4KVODYJT2OEWRGBO/graph.json","events_json":"https://pith.science/api/pith-number/RKCB5VFPNH4KVODYJT2OEWRGBO/events.json","paper":"https://pith.science/paper/RKCB5VFP"},"agent_actions":{"view_html":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO","download_json":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO.json","view_paper":"https://pith.science/paper/RKCB5VFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5733&json=true","fetch_graph":"https://pith.science/api/pith-number/RKCB5VFPNH4KVODYJT2OEWRGBO/graph.json","fetch_events":"https://pith.science/api/pith-number/RKCB5VFPNH4KVODYJT2OEWRGBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO/action/storage_attestation","attest_author":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO/action/author_attestation","sign_citation":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO/action/citation_signature","submit_replication":"https://pith.science/pith/RKCB5VFPNH4KVODYJT2OEWRGBO/action/replication_record"}},"created_at":"2026-05-18T02:31:01.483033+00:00","updated_at":"2026-05-18T02:31:01.483033+00:00"}