{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DR73BR3VOUHJQFJD2O4WSCYZBB","short_pith_number":"pith:DR73BR3V","schema_version":"1.0","canonical_sha256":"1c7fb0c775750e981523d3b9690b190862786cba6c8928ec060734fee3855df3","source":{"kind":"arxiv","id":"0907.4775","version":2},"attestation_state":"computed","paper":{"title":"Complexity Classes of Equivalence Problems Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Lance Fortnow","submitted_at":"2009-07-27T21:30:02Z","abstract_excerpt":"To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism algorithms, and the equality of permutation groups given by generators. To determine if two graphs are cospectral (have the same eigenvalues), however, we compute their characteristic polynomials and see if they are the same; the characteristic polynomial is a complete invariant for the equivalence relation of cospectrality. This is weaker than a canonical f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0907.4775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-07-27T21:30:02Z","cross_cats_sorted":[],"title_canon_sha256":"7fa42d434779469a1fde79353ed3a09af2c988c4cd2c08daa84c71f7f506c3b8","abstract_canon_sha256":"efa29768d1cf63cdf2d4d1cb75c84d64848390127b86e20990002bc69501675d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.478869Z","signature_b64":"j4e65qkjrrsT0uUYR/t2zc8VvdEvyDakiDrFwSjbRueT6huzRkHJhpyGYqWeLMo540ghT8A1J6jvEJBi5BGOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c7fb0c775750e981523d3b9690b190862786cba6c8928ec060734fee3855df3","last_reissued_at":"2026-05-18T04:19:12.478407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.478407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Classes of Equivalence Problems Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Lance Fortnow","submitted_at":"2009-07-27T21:30:02Z","abstract_excerpt":"To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism algorithms, and the equality of permutation groups given by generators. To determine if two graphs are cospectral (have the same eigenvalues), however, we compute their characteristic polynomials and see if they are the same; the characteristic polynomial is a complete invariant for the equivalence relation of cospectrality. This is weaker than a canonical f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4775","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0907.4775","created_at":"2026-05-18T04:19:12.478482+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.4775v2","created_at":"2026-05-18T04:19:12.478482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4775","created_at":"2026-05-18T04:19:12.478482+00:00"},{"alias_kind":"pith_short_12","alias_value":"DR73BR3VOUHJ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DR73BR3VOUHJQFJD","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DR73BR3V","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB","json":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB.json","graph_json":"https://pith.science/api/pith-number/DR73BR3VOUHJQFJD2O4WSCYZBB/graph.json","events_json":"https://pith.science/api/pith-number/DR73BR3VOUHJQFJD2O4WSCYZBB/events.json","paper":"https://pith.science/paper/DR73BR3V"},"agent_actions":{"view_html":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB","download_json":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB.json","view_paper":"https://pith.science/paper/DR73BR3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.4775&json=true","fetch_graph":"https://pith.science/api/pith-number/DR73BR3VOUHJQFJD2O4WSCYZBB/graph.json","fetch_events":"https://pith.science/api/pith-number/DR73BR3VOUHJQFJD2O4WSCYZBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB/action/storage_attestation","attest_author":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB/action/author_attestation","sign_citation":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB/action/citation_signature","submit_replication":"https://pith.science/pith/DR73BR3VOUHJQFJD2O4WSCYZBB/action/replication_record"}},"created_at":"2026-05-18T04:19:12.478482+00:00","updated_at":"2026-05-18T04:19:12.478482+00:00"}