{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NPFD42VDNYEA4KXLPV7RARE4FT","short_pith_number":"pith:NPFD42VD","schema_version":"1.0","canonical_sha256":"6bca3e6aa36e080e2aeb7d7f10449c2cce1d0c3dd8438017ea44806f6d4548ac","source":{"kind":"arxiv","id":"1212.3055","version":2},"attestation_state":"computed","paper":{"title":"New Invariants for the Graph Isomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alexander Gamkrelidze, Gunter Hotz, Levan Varamashvili","submitted_at":"2012-12-13T05:35:32Z","abstract_excerpt":"In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other well-known methods could not compute (such as special Furer Gadgets and point-line incidence graphs of finite projective planes of higher degrees"},"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":"1212.3055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-13T05:35:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fb7479e9d801b3705f15eb64e59b6101d17cdbf4c76a396bb70c118347350337","abstract_canon_sha256":"dd3fef31da3dcf8f2df17c9532e50603c78ed4e6e6fe10dc409c77397188c8fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.548189Z","signature_b64":"+DcnILYQ8kf134yR5NUKjMh8QWhA7jeeTekmm5On3ue6bbi7Ov5XGMVjUX0VjDceKFjfKbegYASj5Vjs6w/7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bca3e6aa36e080e2aeb7d7f10449c2cce1d0c3dd8438017ea44806f6d4548ac","last_reissued_at":"2026-05-18T01:34:59.547284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.547284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Invariants for the Graph Isomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alexander Gamkrelidze, Gunter Hotz, Levan Varamashvili","submitted_at":"2012-12-13T05:35:32Z","abstract_excerpt":"In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other well-known methods could not compute (such as special Furer Gadgets and point-line incidence graphs of finite projective planes of higher degrees"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3055","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":"1212.3055","created_at":"2026-05-18T01:34:59.547489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3055v2","created_at":"2026-05-18T01:34:59.547489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3055","created_at":"2026-05-18T01:34:59.547489+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPFD42VDNYEA","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPFD42VDNYEA4KXL","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPFD42VD","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.03787","citing_title":"Finding Graph Isomorphisms in Heated Spaces in Almost No Time","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT","json":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT.json","graph_json":"https://pith.science/api/pith-number/NPFD42VDNYEA4KXLPV7RARE4FT/graph.json","events_json":"https://pith.science/api/pith-number/NPFD42VDNYEA4KXLPV7RARE4FT/events.json","paper":"https://pith.science/paper/NPFD42VD"},"agent_actions":{"view_html":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT","download_json":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT.json","view_paper":"https://pith.science/paper/NPFD42VD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3055&json=true","fetch_graph":"https://pith.science/api/pith-number/NPFD42VDNYEA4KXLPV7RARE4FT/graph.json","fetch_events":"https://pith.science/api/pith-number/NPFD42VDNYEA4KXLPV7RARE4FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT/action/storage_attestation","attest_author":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT/action/author_attestation","sign_citation":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT/action/citation_signature","submit_replication":"https://pith.science/pith/NPFD42VDNYEA4KXLPV7RARE4FT/action/replication_record"}},"created_at":"2026-05-18T01:34:59.547489+00:00","updated_at":"2026-05-18T01:34:59.547489+00:00"}