{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QI2SLWFI4JFUZDDHDL2RFDD7T4","short_pith_number":"pith:QI2SLWFI","schema_version":"1.0","canonical_sha256":"823525d8a8e24b4c8c671af5128c7f9f0b073003a3612ec13f48aa5fc2b73280","source":{"kind":"arxiv","id":"1603.00303","version":1},"attestation_state":"computed","paper":{"title":"Tattooing and the Tattoo Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Naduvath Sudev","submitted_at":"2016-03-01T15:01:28Z","abstract_excerpt":"Consider a network $D$ of pipes which have to be cleaned using some cleaning agents, called brushes, assigned to some vertices. The minimum number of brushes required for cleaning the network $D$ is called its brush number. The tattooing of a simple connected directed graph $D$ is a particular type of the cleaning in which an arc are coloured by the colour of the colour-brush transiting it and the tattoo number of $D$ is a corresponding derivative of brush numbers in it. Tattooing along an out-arc of a vertex $v$ may proceed if a minimum set of colour-brushes is allocated (primary colours) or "},"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":"1603.00303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-03-01T15:01:28Z","cross_cats_sorted":[],"title_canon_sha256":"05cf7ee8e7cb1567c1b1174b34a7dcc60016df81b980e421f5a62d3161a36ac7","abstract_canon_sha256":"13b2c1aaa974ce0aea07aeff2d81e38c179f5922c55953a2a530e774d168aaaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:45.372629Z","signature_b64":"2PUIGiD+HdJHo/s+PjiFB28bkTQ/0h5CBMN8JOhU9Dus46jI/B2j9S15Vz/br8qwdIbuqX3eW5mDBp4Ld8qbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823525d8a8e24b4c8c671af5128c7f9f0b073003a3612ec13f48aa5fc2b73280","last_reissued_at":"2026-05-18T01:19:45.372015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:45.372015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tattooing and the Tattoo Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Naduvath Sudev","submitted_at":"2016-03-01T15:01:28Z","abstract_excerpt":"Consider a network $D$ of pipes which have to be cleaned using some cleaning agents, called brushes, assigned to some vertices. The minimum number of brushes required for cleaning the network $D$ is called its brush number. The tattooing of a simple connected directed graph $D$ is a particular type of the cleaning in which an arc are coloured by the colour of the colour-brush transiting it and the tattoo number of $D$ is a corresponding derivative of brush numbers in it. Tattooing along an out-arc of a vertex $v$ may proceed if a minimum set of colour-brushes is allocated (primary colours) or "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00303","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":"1603.00303","created_at":"2026-05-18T01:19:45.372106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00303v1","created_at":"2026-05-18T01:19:45.372106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00303","created_at":"2026-05-18T01:19:45.372106+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI2SLWFI4JFU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI2SLWFI4JFUZDDH","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI2SLWFI","created_at":"2026-05-18T12:30:39.010887+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/QI2SLWFI4JFUZDDHDL2RFDD7T4","json":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4.json","graph_json":"https://pith.science/api/pith-number/QI2SLWFI4JFUZDDHDL2RFDD7T4/graph.json","events_json":"https://pith.science/api/pith-number/QI2SLWFI4JFUZDDHDL2RFDD7T4/events.json","paper":"https://pith.science/paper/QI2SLWFI"},"agent_actions":{"view_html":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4","download_json":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4.json","view_paper":"https://pith.science/paper/QI2SLWFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00303&json=true","fetch_graph":"https://pith.science/api/pith-number/QI2SLWFI4JFUZDDHDL2RFDD7T4/graph.json","fetch_events":"https://pith.science/api/pith-number/QI2SLWFI4JFUZDDHDL2RFDD7T4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4/action/storage_attestation","attest_author":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4/action/author_attestation","sign_citation":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4/action/citation_signature","submit_replication":"https://pith.science/pith/QI2SLWFI4JFUZDDHDL2RFDD7T4/action/replication_record"}},"created_at":"2026-05-18T01:19:45.372106+00:00","updated_at":"2026-05-18T01:19:45.372106+00:00"}