{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:74JE2XLLWECVYKTPKPPRQJWDBG","short_pith_number":"pith:74JE2XLL","canonical_record":{"source":{"id":"2505.21299","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:02:20Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d8d874be20b79acf1450e8a749a22bcb03b490c7a82026622074c4938fc6ede9","abstract_canon_sha256":"0adf841b3f3ba1ebcff75e64d56c4f3097537176ebf98318c3a2b749b60484a5"},"schema_version":"1.0"},"canonical_sha256":"ff124d5d6bb1055c2a6f53df1826c309911c25e5eec20abf44fc275dfd23b256","source":{"kind":"arxiv","id":"2505.21299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21299","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21299v2","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21299","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"74JE2XLLWECV","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_16","alias_value":"74JE2XLLWECVYKTP","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_8","alias_value":"74JE2XLL","created_at":"2026-07-05T11:15:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:74JE2XLLWECVYKTPKPPRQJWDBG","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21299","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:02:20Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d8d874be20b79acf1450e8a749a22bcb03b490c7a82026622074c4938fc6ede9","abstract_canon_sha256":"0adf841b3f3ba1ebcff75e64d56c4f3097537176ebf98318c3a2b749b60484a5"},"schema_version":"1.0"},"canonical_sha256":"ff124d5d6bb1055c2a6f53df1826c309911c25e5eec20abf44fc275dfd23b256","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:00.490282Z","signature_b64":"kCryHyPVptg02WOOXsT523Wvq+WbZi032slI1hAm4Yn/gN0jpv/YIM8XbmHSn7vz8MvnobZj9Y1e5NTLDM3KAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff124d5d6bb1055c2a6f53df1826c309911c25e5eec20abf44fc275dfd23b256","last_reissued_at":"2026-07-05T11:15:00.489803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:00.489803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21299","source_version":2,"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-07-05T11:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqEVQlFJVCfjMYitWV+SMZXTsGn6i1ekq/6noHYIPkaMnpC5RBcRq2F1ekO/C8snpS7AaK5J4MKR5YSuRVrCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:31:20.759630Z"},"content_sha256":"df185c0dab2e6459b7e7fa13cc897dd722c4a98fc6bbe3884400158ad132accb","schema_version":"1.0","event_id":"sha256:df185c0dab2e6459b7e7fa13cc897dd722c4a98fc6bbe3884400158ad132accb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:74JE2XLLWECVYKTPKPPRQJWDBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Distinguishing Graphs and Cost Number using Automorphism Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Alexa Gopaulsingh, Amitayu Banerjee, Zal\\'an Moln\\'ar","submitted_at":"2025-05-27T15:02:20Z","abstract_excerpt":"A distinguishing coloring of a graph is a vertex coloring such that only the identity automorphism of the graph preserves the coloring. A 2-distinguishable graph is a graph which can be distinguished using 2 colors. The cost $\\rho(G)$ of a 2-distinguishable graph is the smallest size of a color set of a distinguishing coloring of $G$. The determining number of a graph, $Det(G)$, is the minimum number of nodes, which if fixed by a coloring, would ensure that the coloring distinguishes the entire graph.\n  Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) posed an open problem which ask"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21299","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.21299/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ruy5RA71XKqKzlqaYq56H5XX/RuiYp8hSYdUf/KnuQvH1qS7vXUIdeLmfCfQzRGWwEf+66SC1Ju4UFFUVqrMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:31:20.760137Z"},"content_sha256":"ffcf0a0899222d03883f28fc798243cf45eca41213a113193ac0a23bc9b30b51","schema_version":"1.0","event_id":"sha256:ffcf0a0899222d03883f28fc798243cf45eca41213a113193ac0a23bc9b30b51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74JE2XLLWECVYKTPKPPRQJWDBG/bundle.json","state_url":"https://pith.science/pith/74JE2XLLWECVYKTPKPPRQJWDBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74JE2XLLWECVYKTPKPPRQJWDBG/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-08-08T09:31:20Z","links":{"resolver":"https://pith.science/pith/74JE2XLLWECVYKTPKPPRQJWDBG","bundle":"https://pith.science/pith/74JE2XLLWECVYKTPKPPRQJWDBG/bundle.json","state":"https://pith.science/pith/74JE2XLLWECVYKTPKPPRQJWDBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74JE2XLLWECVYKTPKPPRQJWDBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:74JE2XLLWECVYKTPKPPRQJWDBG","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":"0adf841b3f3ba1ebcff75e64d56c4f3097537176ebf98318c3a2b749b60484a5","cross_cats_sorted":["math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:02:20Z","title_canon_sha256":"d8d874be20b79acf1450e8a749a22bcb03b490c7a82026622074c4938fc6ede9"},"schema_version":"1.0","source":{"id":"2505.21299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21299","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21299v2","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21299","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"74JE2XLLWECV","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_16","alias_value":"74JE2XLLWECVYKTP","created_at":"2026-07-05T11:15:00Z"},{"alias_kind":"pith_short_8","alias_value":"74JE2XLL","created_at":"2026-07-05T11:15:00Z"}],"graph_snapshots":[{"event_id":"sha256:ffcf0a0899222d03883f28fc798243cf45eca41213a113193ac0a23bc9b30b51","target":"graph","created_at":"2026-07-05T11:15:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.21299/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A distinguishing coloring of a graph is a vertex coloring such that only the identity automorphism of the graph preserves the coloring. A 2-distinguishable graph is a graph which can be distinguished using 2 colors. The cost $\\rho(G)$ of a 2-distinguishable graph is the smallest size of a color set of a distinguishing coloring of $G$. The determining number of a graph, $Det(G)$, is the minimum number of nodes, which if fixed by a coloring, would ensure that the coloring distinguishes the entire graph.\n  Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) posed an open problem which ask","authors_text":"Alexa Gopaulsingh, Amitayu Banerjee, Zal\\'an Moln\\'ar","cross_cats":["math.GR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:02:20Z","title":"On Distinguishing Graphs and Cost Number using Automorphism Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21299","kind":"arxiv","version":2},"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:df185c0dab2e6459b7e7fa13cc897dd722c4a98fc6bbe3884400158ad132accb","target":"record","created_at":"2026-07-05T11:15:00Z","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":"0adf841b3f3ba1ebcff75e64d56c4f3097537176ebf98318c3a2b749b60484a5","cross_cats_sorted":["math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:02:20Z","title_canon_sha256":"d8d874be20b79acf1450e8a749a22bcb03b490c7a82026622074c4938fc6ede9"},"schema_version":"1.0","source":{"id":"2505.21299","kind":"arxiv","version":2}},"canonical_sha256":"ff124d5d6bb1055c2a6f53df1826c309911c25e5eec20abf44fc275dfd23b256","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff124d5d6bb1055c2a6f53df1826c309911c25e5eec20abf44fc275dfd23b256","first_computed_at":"2026-07-05T11:15:00.489803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:00.489803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kCryHyPVptg02WOOXsT523Wvq+WbZi032slI1hAm4Yn/gN0jpv/YIM8XbmHSn7vz8MvnobZj9Y1e5NTLDM3KAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:00.490282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df185c0dab2e6459b7e7fa13cc897dd722c4a98fc6bbe3884400158ad132accb","sha256:ffcf0a0899222d03883f28fc798243cf45eca41213a113193ac0a23bc9b30b51"],"state_sha256":"b1d95f601dad83c47a549abb4459b9fe25caa033281ed8cf80d49356868d0b00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzZgWtjTeHh1G/6whIv6FVOBqtlPRHMdC/qB00BguGIbBKs5p9WOidJykhVkRjuQvuA9tGIpX1zme6wvoHOcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:31:20.765134Z","bundle_sha256":"13664dc31476f5d66df85883470ccf7e1c953046d7b88650540174a77b8eba20"}}