{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5C52TSCU5B7C46NGGPSRJ4HUK3","short_pith_number":"pith:5C52TSCU","canonical_record":{"source":{"id":"1502.01255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T16:57:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"aab69c13d02dc2cd9475c72bee7284bebd2698a97b19796761c3b28dc6c5a1a7","abstract_canon_sha256":"dc4f3ec21951ad03c166d1dd3660c9984ec2de7dd2dac54c9c6eb19c50b76818"},"schema_version":"1.0"},"canonical_sha256":"e8bba9c854e87e2e79a633e514f0f456c9bbc90addfbe01791793f6d9cf87a80","source":{"kind":"arxiv","id":"1502.01255","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01255","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01255v3","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01255","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"5C52TSCU5B7C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5C52TSCU5B7C46NG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5C52TSCU","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5C52TSCU5B7C46NGGPSRJ4HUK3","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T16:57:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"aab69c13d02dc2cd9475c72bee7284bebd2698a97b19796761c3b28dc6c5a1a7","abstract_canon_sha256":"dc4f3ec21951ad03c166d1dd3660c9984ec2de7dd2dac54c9c6eb19c50b76818"},"schema_version":"1.0"},"canonical_sha256":"e8bba9c854e87e2e79a633e514f0f456c9bbc90addfbe01791793f6d9cf87a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:11.229281Z","signature_b64":"cbbN6c6OrlLCVwKbWSguYX90v9iSN5v/PnP3rEBkI5iF2XNMnYGp7C/XiW4QObkJBPuInjPCeVB1gatopnrnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8bba9c854e87e2e79a633e514f0f456c9bbc90addfbe01791793f6d9cf87a80","last_reissued_at":"2026-05-18T02:17:11.228778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:11.228778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01255","source_version":3,"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-18T02:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9YPGJZKy4JuJgvKpWvLN2EFelEVIE+59VCyOWUQjnUar31M/7DLVtsrwoMp/g2HI/nEPBwZGm5WbTdPqD8jDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:48.351685Z"},"content_sha256":"558594df86c9dd4f3f2fcc065c9de674a413a9cfe9a5179379ca6ced01044296","schema_version":"1.0","event_id":"sha256:558594df86c9dd4f3f2fcc065c9de674a413a9cfe9a5179379ca6ced01044296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5C52TSCU5B7C46NGGPSRJ4HUK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Isomorphism, Color Refinement, and Compactness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Gaurav Rattan, Johannes K\\\"obler, Oleg Verbitsky, V. Arvind","submitted_at":"2015-02-04T16:57:33Z","abstract_excerpt":"Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in distinguishing G from any non-isomorphic graph H. Tinhofer (1991) explored a linear programming approach to Graph Isomorphism and defined compact graphs: A graph is compact if its fractional automorphisms polytope is integral. Tinhofer noted that isomorphism testing for compact graphs can be done quite efficiently by linear programming. However, the problem of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01255","kind":"arxiv","version":3},"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-18T02:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEBQ4LihZb45w1O7IiLpgLNqK4Ve2ntyGfNA70/7WE8XKpe4973rPruqnG7W26QVSXXy389frBkSXWeWvGmQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:48.352360Z"},"content_sha256":"d2be108586b16611cf150b65c57d142d9a4bfaaa89fed969d971eea5656f6568","schema_version":"1.0","event_id":"sha256:d2be108586b16611cf150b65c57d142d9a4bfaaa89fed969d971eea5656f6568"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/bundle.json","state_url":"https://pith.science/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/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-05-25T16:40:48Z","links":{"resolver":"https://pith.science/pith/5C52TSCU5B7C46NGGPSRJ4HUK3","bundle":"https://pith.science/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/bundle.json","state":"https://pith.science/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C52TSCU5B7C46NGGPSRJ4HUK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5C52TSCU5B7C46NGGPSRJ4HUK3","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":"dc4f3ec21951ad03c166d1dd3660c9984ec2de7dd2dac54c9c6eb19c50b76818","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T16:57:33Z","title_canon_sha256":"aab69c13d02dc2cd9475c72bee7284bebd2698a97b19796761c3b28dc6c5a1a7"},"schema_version":"1.0","source":{"id":"1502.01255","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01255","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01255v3","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01255","created_at":"2026-05-18T02:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"5C52TSCU5B7C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5C52TSCU5B7C46NG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5C52TSCU","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:d2be108586b16611cf150b65c57d142d9a4bfaaa89fed969d971eea5656f6568","target":"graph","created_at":"2026-05-18T02:17:11Z","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":"Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in distinguishing G from any non-isomorphic graph H. Tinhofer (1991) explored a linear programming approach to Graph Isomorphism and defined compact graphs: A graph is compact if its fractional automorphisms polytope is integral. Tinhofer noted that isomorphism testing for compact graphs can be done quite efficiently by linear programming. However, the problem of c","authors_text":"Gaurav Rattan, Johannes K\\\"obler, Oleg Verbitsky, V. Arvind","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T16:57:33Z","title":"Graph Isomorphism, Color Refinement, and Compactness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01255","kind":"arxiv","version":3},"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:558594df86c9dd4f3f2fcc065c9de674a413a9cfe9a5179379ca6ced01044296","target":"record","created_at":"2026-05-18T02:17:11Z","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":"dc4f3ec21951ad03c166d1dd3660c9984ec2de7dd2dac54c9c6eb19c50b76818","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T16:57:33Z","title_canon_sha256":"aab69c13d02dc2cd9475c72bee7284bebd2698a97b19796761c3b28dc6c5a1a7"},"schema_version":"1.0","source":{"id":"1502.01255","kind":"arxiv","version":3}},"canonical_sha256":"e8bba9c854e87e2e79a633e514f0f456c9bbc90addfbe01791793f6d9cf87a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8bba9c854e87e2e79a633e514f0f456c9bbc90addfbe01791793f6d9cf87a80","first_computed_at":"2026-05-18T02:17:11.228778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:11.228778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cbbN6c6OrlLCVwKbWSguYX90v9iSN5v/PnP3rEBkI5iF2XNMnYGp7C/XiW4QObkJBPuInjPCeVB1gatopnrnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:11.229281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01255","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:558594df86c9dd4f3f2fcc065c9de674a413a9cfe9a5179379ca6ced01044296","sha256:d2be108586b16611cf150b65c57d142d9a4bfaaa89fed969d971eea5656f6568"],"state_sha256":"b426f4da08c1cdf80ab7c6c98b92cfb2519d52c8fc83e06b08e29418fbc69010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yD5qpNQ5iINoM2BI2aIXRRkQklmIxSnT9pBGWbkuukv9sh8l691CD0mh3Rh7tn/eV4+nL2+RojT8/S7dO0QqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:40:48.355301Z","bundle_sha256":"52f53e0042fe7dd805a9f0ece428283a19de149dbd92060eff5f6d4f27d35f6e"}}