{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L3ZLNN5SDM3ZACCGBSOTG4U4CU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b9ecd5e866ac60e0fd00546dfc4665a83dcc2e3ea2148d8b500fc7df56d85a49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T15:03:01Z","title_canon_sha256":"e5d334c2e5c19bbae2edf600e9ec7b596de6c8648e5b43b7db260f5aa1e593e0"},"schema_version":"1.0","source":{"id":"1810.02265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02265","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02265v1","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02265","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"L3ZLNN5SDM3Z","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3ZLNN5SDM3ZACCG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3ZLNN5S","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:8e22f3ef0a23bf9dd1aa3d212e4c08f7e8addb63e8c451f53be8ec9c121ddb10","target":"graph","created_at":"2026-05-18T00:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the identity. For infinite graphs $D(G)$ is bounded by the supremum of the valences, and for finite graphs by $\\Delta(G)+1$, where $\\Delta(G)$ is the maximum valence. Given a finite or infinite tree $T$ of bounded finite valence $k$ and an integer $c$, where $2 \\leq c \\leq k$, we are interested in coloring the vertices of $T$ by $c$ colors, such that every color preserving automorphism fixes as many vertices as possible","authors_text":"Hannah Schreiber, Judith Kloas, Svenja H\\\"uning, Thomas W. Tucker, Wilfried Imrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T15:03:01Z","title":"Distinguishing locally finite trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02265","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:306943f1f67ac7b0d04dcbef44ee4d6043e7d3c597c1331304f3a1f4674231ac","target":"record","created_at":"2026-05-18T00:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b9ecd5e866ac60e0fd00546dfc4665a83dcc2e3ea2148d8b500fc7df56d85a49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T15:03:01Z","title_canon_sha256":"e5d334c2e5c19bbae2edf600e9ec7b596de6c8648e5b43b7db260f5aa1e593e0"},"schema_version":"1.0","source":{"id":"1810.02265","kind":"arxiv","version":1}},"canonical_sha256":"5ef2b6b7b21b379008460c9d33729c1516630a2f6b53c2c53c5e92196ae460de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef2b6b7b21b379008460c9d33729c1516630a2f6b53c2c53c5e92196ae460de","first_computed_at":"2026-05-18T00:04:05.779462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:05.779462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P/P51CAbbtdcQ2137sEquZfuOYYy7trAJBvW/uX6IT4FNSMdJHDg6iIduzZyDug5LLQJpxj3iK0NI1xsE3b/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:05.780037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:306943f1f67ac7b0d04dcbef44ee4d6043e7d3c597c1331304f3a1f4674231ac","sha256:8e22f3ef0a23bf9dd1aa3d212e4c08f7e8addb63e8c451f53be8ec9c121ddb10"],"state_sha256":"febe81ba65ed14973aed2770eb53bfc08040a965942d44017bc209d10e9dd5f3"}