{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XZQSBIVJFM44K5VCLCBB24IIZ4","short_pith_number":"pith:XZQSBIVJ","schema_version":"1.0","canonical_sha256":"be6120a2a92b39c576a258821d7108cf2878f8746a607faa43995c9c4a08ffdf","source":{"kind":"arxiv","id":"1709.05797","version":1},"attestation_state":"computed","paper":{"title":"Distinguishing graphs of maximum valence 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Schreiber, Judith Kloas, Svenja H\\\"uning, Thomas Tucker, Wilfried Imrich","submitted_at":"2017-09-18T07:49:00Z","abstract_excerpt":"The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color $G$ such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs $G$ of maximum valence $\\triangle(G)=3$ and distinguishing number $D(G) = 3$. As one of the consequences we get that all infinite connected graphs with $\\triangle(G)=3$ are 2-distinguishable."},"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":"1709.05797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T07:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"444ed279b2ab0e1aea4787b64edb9445005459e830630013e459afff21b6d330","abstract_canon_sha256":"09237752ad4cf1225ded750677b32a363c1375a9cd9b2d95539a5de13ba1130b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.366211Z","signature_b64":"VuIdZFm+5oDqoAzwugNqN9xgaSzDQnRmgy0rfu0vkCEbt/yyq/aQ/SOwgF/LDaF6koFpXuxYaIjgoDReNbF8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be6120a2a92b39c576a258821d7108cf2878f8746a607faa43995c9c4a08ffdf","last_reissued_at":"2026-05-18T00:34:59.365591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.365591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing graphs of maximum valence 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Schreiber, Judith Kloas, Svenja H\\\"uning, Thomas Tucker, Wilfried Imrich","submitted_at":"2017-09-18T07:49:00Z","abstract_excerpt":"The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color $G$ such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs $G$ of maximum valence $\\triangle(G)=3$ and distinguishing number $D(G) = 3$. As one of the consequences we get that all infinite connected graphs with $\\triangle(G)=3$ are 2-distinguishable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05797","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":"1709.05797","created_at":"2026-05-18T00:34:59.365713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05797v1","created_at":"2026-05-18T00:34:59.365713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05797","created_at":"2026-05-18T00:34:59.365713+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZQSBIVJFM44","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZQSBIVJFM44K5VC","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZQSBIVJ","created_at":"2026-05-18T12:31:56.362134+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/XZQSBIVJFM44K5VCLCBB24IIZ4","json":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4.json","graph_json":"https://pith.science/api/pith-number/XZQSBIVJFM44K5VCLCBB24IIZ4/graph.json","events_json":"https://pith.science/api/pith-number/XZQSBIVJFM44K5VCLCBB24IIZ4/events.json","paper":"https://pith.science/paper/XZQSBIVJ"},"agent_actions":{"view_html":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4","download_json":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4.json","view_paper":"https://pith.science/paper/XZQSBIVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05797&json=true","fetch_graph":"https://pith.science/api/pith-number/XZQSBIVJFM44K5VCLCBB24IIZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/XZQSBIVJFM44K5VCLCBB24IIZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4/action/storage_attestation","attest_author":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4/action/author_attestation","sign_citation":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4/action/citation_signature","submit_replication":"https://pith.science/pith/XZQSBIVJFM44K5VCLCBB24IIZ4/action/replication_record"}},"created_at":"2026-05-18T00:34:59.365713+00:00","updated_at":"2026-05-18T00:34:59.365713+00:00"}