{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U5ITAG6YBL7ABNKQYJJDJETDXT","short_pith_number":"pith:U5ITAG6Y","canonical_record":{"source":{"id":"1602.08371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:36:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"64cd461e635bcf9c21b36dfa47f269d3c90fc84e389b4fd1bd20a9e68268d1e7","abstract_canon_sha256":"406d6be5a8fd2c9fbf8b0adf911477d622bc52898ab2c09ead68670d3e26422b"},"schema_version":"1.0"},"canonical_sha256":"a751301bd80afe00b550c252349263bcedcf423918db93c319242ae2a2707d67","source":{"kind":"arxiv","id":"1602.08371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08371","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08371v2","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08371","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"U5ITAG6YBL7A","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U5ITAG6YBL7ABNKQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U5ITAG6Y","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U5ITAG6YBL7ABNKQYJJDJETDXT","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:36:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"64cd461e635bcf9c21b36dfa47f269d3c90fc84e389b4fd1bd20a9e68268d1e7","abstract_canon_sha256":"406d6be5a8fd2c9fbf8b0adf911477d622bc52898ab2c09ead68670d3e26422b"},"schema_version":"1.0"},"canonical_sha256":"a751301bd80afe00b550c252349263bcedcf423918db93c319242ae2a2707d67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.478683Z","signature_b64":"UV4DZ8k9Ghy5uSDVGPG8RMUOxdimqbHjQbKB0xauXfibWkKxfIe/unOUHV384FIf/FNwjGUUEx0SBWuUdps4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a751301bd80afe00b550c252349263bcedcf423918db93c319242ae2a2707d67","last_reissued_at":"2026-05-18T01:12:01.478343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.478343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08371","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-05-18T01:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6vvjQUduBaGIJ8a4SyXSYpXw6z2OuXqE9ntWAZAXwjsXPObDsaPLjJj725JA6gEzLsdGRbr60kk1p3eVkPxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:20:00.965483Z"},"content_sha256":"12ef981576f5e67bf72473928016ca7960f8580190b7e026db7df162ab859ed3","schema_version":"1.0","event_id":"sha256:12ef981576f5e67bf72473928016ca7960f8580190b7e026db7df162ab859ed3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U5ITAG6YBL7ABNKQYJJDJETDXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Isomorphism for unit square graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Neuen","submitted_at":"2016-02-26T15:36:43Z","abstract_excerpt":"In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show that the Graph Isomorphism Problem for unit square graphs, intersection graphs of axis-parallel unit squares in the plane, can be solved in polynomial time. Since the recognition problem for this class of graphs is NP-hard we can not rely on standard techniques for geometric graphs based on constructing a canonical realization. Instead, we develop new techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08371","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":""},"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-18T01:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sjn3FJVMM2bzof5GP+VAOXdhzFifgR5IMTnaXgl55Pz+RQuM6+DLWsxHdNjgcp7dYUl4wQcSTfJzXTfl5YB9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:20:00.965918Z"},"content_sha256":"d3c40fecad4c83a95ea3e36fb08b882e1358a0c5cc59a83aeafde85ffdb32af7","schema_version":"1.0","event_id":"sha256:d3c40fecad4c83a95ea3e36fb08b882e1358a0c5cc59a83aeafde85ffdb32af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/bundle.json","state_url":"https://pith.science/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/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-27T01:20:00Z","links":{"resolver":"https://pith.science/pith/U5ITAG6YBL7ABNKQYJJDJETDXT","bundle":"https://pith.science/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/bundle.json","state":"https://pith.science/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5ITAG6YBL7ABNKQYJJDJETDXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U5ITAG6YBL7ABNKQYJJDJETDXT","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":"406d6be5a8fd2c9fbf8b0adf911477d622bc52898ab2c09ead68670d3e26422b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:36:43Z","title_canon_sha256":"64cd461e635bcf9c21b36dfa47f269d3c90fc84e389b4fd1bd20a9e68268d1e7"},"schema_version":"1.0","source":{"id":"1602.08371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08371","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08371v2","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08371","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"U5ITAG6YBL7A","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U5ITAG6YBL7ABNKQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U5ITAG6Y","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d3c40fecad4c83a95ea3e36fb08b882e1358a0c5cc59a83aeafde85ffdb32af7","target":"graph","created_at":"2026-05-18T01:12:01Z","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":"In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show that the Graph Isomorphism Problem for unit square graphs, intersection graphs of axis-parallel unit squares in the plane, can be solved in polynomial time. Since the recognition problem for this class of graphs is NP-hard we can not rely on standard techniques for geometric graphs based on constructing a canonical realization. Instead, we develop new techn","authors_text":"Daniel Neuen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:36:43Z","title":"Graph Isomorphism for unit square graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08371","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:12ef981576f5e67bf72473928016ca7960f8580190b7e026db7df162ab859ed3","target":"record","created_at":"2026-05-18T01:12:01Z","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":"406d6be5a8fd2c9fbf8b0adf911477d622bc52898ab2c09ead68670d3e26422b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:36:43Z","title_canon_sha256":"64cd461e635bcf9c21b36dfa47f269d3c90fc84e389b4fd1bd20a9e68268d1e7"},"schema_version":"1.0","source":{"id":"1602.08371","kind":"arxiv","version":2}},"canonical_sha256":"a751301bd80afe00b550c252349263bcedcf423918db93c319242ae2a2707d67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a751301bd80afe00b550c252349263bcedcf423918db93c319242ae2a2707d67","first_computed_at":"2026-05-18T01:12:01.478343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:01.478343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UV4DZ8k9Ghy5uSDVGPG8RMUOxdimqbHjQbKB0xauXfibWkKxfIe/unOUHV384FIf/FNwjGUUEx0SBWuUdps4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:01.478683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ef981576f5e67bf72473928016ca7960f8580190b7e026db7df162ab859ed3","sha256:d3c40fecad4c83a95ea3e36fb08b882e1358a0c5cc59a83aeafde85ffdb32af7"],"state_sha256":"14218c1cb899a370948dc03c7e2d92e1e90a881699d91b044046e20bdf549f93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RK2knQQGSC4rTvWpo9QdehL3fUVWokgGxfpdyzwFXvybxUPymVrfES2ScxU7qLWhI69jnebHSnasANE4etbnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:20:00.968885Z","bundle_sha256":"3ccdac5ed3666c6be3e5c28221fe8ca166d85529870a9f20dea4adc439829476"}}