{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4GT4Y6MB57VOXBZ4NY5YK32BD7","short_pith_number":"pith:4GT4Y6MB","canonical_record":{"source":{"id":"1106.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-23T17:26:11Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"ec0dc8e5cd4bb12448202d3e3e20bc2df866fdc1292243909c11148ba0aa22d0","abstract_canon_sha256":"3e0f1e4853b543cb6f4275dab0ec063bf1c10c187b74ccd82b437c5d831bea54"},"schema_version":"1.0"},"canonical_sha256":"e1a7cc7981efeaeb873c6e3b856f411fc031e68464b1aaa4cf1f01f1f442e0d1","source":{"kind":"arxiv","id":"1106.4778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4778","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4778v1","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4778","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"4GT4Y6MB57VO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4GT4Y6MB57VOXBZ4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4GT4Y6MB","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4GT4Y6MB57VOXBZ4NY5YK32BD7","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-23T17:26:11Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"ec0dc8e5cd4bb12448202d3e3e20bc2df866fdc1292243909c11148ba0aa22d0","abstract_canon_sha256":"3e0f1e4853b543cb6f4275dab0ec063bf1c10c187b74ccd82b437c5d831bea54"},"schema_version":"1.0"},"canonical_sha256":"e1a7cc7981efeaeb873c6e3b856f411fc031e68464b1aaa4cf1f01f1f442e0d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:26.631550Z","signature_b64":"9Wb9Sk2+a4B+BUIK839kSiQWaN07khZngZ6gDVquvboVGQSl7JMHBRytZvAAJLH0djA9cuRb5LuY9pEXa7yVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a7cc7981efeaeb873c6e3b856f411fc031e68464b1aaa4cf1f01f1f442e0d1","last_reissued_at":"2026-05-18T03:33:26.630751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:26.630751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4778","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xa2TFsq3ZamNP5FT2fLAOe1YwCJNvLazHNjK+/6guZh0yjAzGR+OvmRGaycvCvv9b8cV2NofqSdHslit22qpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:29:23.673631Z"},"content_sha256":"eb5220a7e4c64804291e8140d3bc3f934fc88fff9fd5101ddec05585e831d7e9","schema_version":"1.0","event_id":"sha256:eb5220a7e4c64804291e8140d3bc3f934fc88fff9fd5101ddec05585e831d7e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4GT4Y6MB57VOXBZ4NY5YK32BD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishability of infinite groups and graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Mark E. Watkins, Simon M. Smith, Thomas W. Tucker","submitted_at":"2011-06-23T17:26:11Z","abstract_excerpt":"The {\\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\\em distinguishing number} of a graph is the distinguishing number of its full automorphism group acting on its vertex set. A connected graph $\\Gamma$ is said to have {\\em connectivity 1} if there exists a vertex $\\alpha \\in V\\Gamma$ such that $\\Gamma \\setminus \\{\\alpha\\}$ is not connected. For $\\alpha \\in V$, an orbit of the point stabilizer $G_\\alpha$ is called a {\\em suborbit}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4778","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3X8qFUL+56M7S4pvR16RBtNORsCufjNO/DFEN9Se0KvQUkB9xXlOptnAFAa0mK153tLqjbjLig2kASuzUhyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:29:23.673978Z"},"content_sha256":"ce044b3432531ba7e28f3347c093169cbd525113796f19e336b17f8b280d2c7d","schema_version":"1.0","event_id":"sha256:ce044b3432531ba7e28f3347c093169cbd525113796f19e336b17f8b280d2c7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/bundle.json","state_url":"https://pith.science/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:29:23Z","links":{"resolver":"https://pith.science/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7","bundle":"https://pith.science/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/bundle.json","state":"https://pith.science/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GT4Y6MB57VOXBZ4NY5YK32BD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4GT4Y6MB57VOXBZ4NY5YK32BD7","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":"3e0f1e4853b543cb6f4275dab0ec063bf1c10c187b74ccd82b437c5d831bea54","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-23T17:26:11Z","title_canon_sha256":"ec0dc8e5cd4bb12448202d3e3e20bc2df866fdc1292243909c11148ba0aa22d0"},"schema_version":"1.0","source":{"id":"1106.4778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4778","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4778v1","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4778","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"4GT4Y6MB57VO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4GT4Y6MB57VOXBZ4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4GT4Y6MB","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:ce044b3432531ba7e28f3347c093169cbd525113796f19e336b17f8b280d2c7d","target":"graph","created_at":"2026-05-18T03:33:26Z","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 {\\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\\em distinguishing number} of a graph is the distinguishing number of its full automorphism group acting on its vertex set. A connected graph $\\Gamma$ is said to have {\\em connectivity 1} if there exists a vertex $\\alpha \\in V\\Gamma$ such that $\\Gamma \\setminus \\{\\alpha\\}$ is not connected. For $\\alpha \\in V$, an orbit of the point stabilizer $G_\\alpha$ is called a {\\em suborbit}","authors_text":"Mark E. Watkins, Simon M. Smith, Thomas W. Tucker","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-23T17:26:11Z","title":"Distinguishability of infinite groups and graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4778","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:eb5220a7e4c64804291e8140d3bc3f934fc88fff9fd5101ddec05585e831d7e9","target":"record","created_at":"2026-05-18T03:33:26Z","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":"3e0f1e4853b543cb6f4275dab0ec063bf1c10c187b74ccd82b437c5d831bea54","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-23T17:26:11Z","title_canon_sha256":"ec0dc8e5cd4bb12448202d3e3e20bc2df866fdc1292243909c11148ba0aa22d0"},"schema_version":"1.0","source":{"id":"1106.4778","kind":"arxiv","version":1}},"canonical_sha256":"e1a7cc7981efeaeb873c6e3b856f411fc031e68464b1aaa4cf1f01f1f442e0d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a7cc7981efeaeb873c6e3b856f411fc031e68464b1aaa4cf1f01f1f442e0d1","first_computed_at":"2026-05-18T03:33:26.630751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:26.630751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Wb9Sk2+a4B+BUIK839kSiQWaN07khZngZ6gDVquvboVGQSl7JMHBRytZvAAJLH0djA9cuRb5LuY9pEXa7yVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:26.631550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb5220a7e4c64804291e8140d3bc3f934fc88fff9fd5101ddec05585e831d7e9","sha256:ce044b3432531ba7e28f3347c093169cbd525113796f19e336b17f8b280d2c7d"],"state_sha256":"9bd17f225d9045f8e80d42c2f4755123a413d5c4b37c5891b304c9c78cd8b14e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsbF+JnHUtpK3QbwqEbRAxuqLc1r9GySIDQZSjCdKeDVp5UrHqsiElZVu398vjBpm/UNSwO3AvuEJQ++1wi1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:29:23.675995Z","bundle_sha256":"3853838d4ebe31c6b9cdd938fbe15e4388cc2843a6ce4cd156583a5998d82578"}}