{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W4XIUECHVP6GKDQXNWJ7CHY4L6","short_pith_number":"pith:W4XIUECH","schema_version":"1.0","canonical_sha256":"b72e8a1047abfc650e176d93f11f1c5f83498c0259ed238ab979861644bcbe43","source":{"kind":"arxiv","id":"1805.00181","version":1},"attestation_state":"computed","paper":{"title":"Spectrally Robust Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Ali Kemal Sinop, Ioannis Koutis, Vivek Madan","submitted_at":"2018-05-01T04:18:15Z","abstract_excerpt":"We initiate the study of spectral generalizations of the graph isomorphism problem.\n  (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exist a permutation $\\pi$ such that $G\\preceq \\pi(H)$?\n  (b) The Spectrally Robust Graph Isomorphism (SRGI) problem: On input of two graphs $G$ and $H$, find the smallest number $\\kappa$ over all permutations $\\pi$ such that $ \\pi(H) \\preceq G\\preceq \\kappa c \\pi(H)$ for some $c$. SRGI is a natural formulation of the network alignment problem that has various applications, most notably in computational biology.\n  Here"},"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":"1805.00181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T04:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"b1f88a9a19970b0bc48bdd75baa1ddd3ccb52ab84aab1a087b54fe933fd4f2f4","abstract_canon_sha256":"54ca05fa6d70980b7fbdbd297ec76ee0182045400fe76d8b7f3948cf815b1718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.366306Z","signature_b64":"tEdKQ5+1qIO83CxZAOvThZZgpI3B13dOaGXLnpk2zhTzX8wuSvGtc0aUi30PPWHKXFSZ2x22xRS8Eo9qe+fqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b72e8a1047abfc650e176d93f11f1c5f83498c0259ed238ab979861644bcbe43","last_reissued_at":"2026-05-18T00:17:10.365460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.365460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectrally Robust Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Ali Kemal Sinop, Ioannis Koutis, Vivek Madan","submitted_at":"2018-05-01T04:18:15Z","abstract_excerpt":"We initiate the study of spectral generalizations of the graph isomorphism problem.\n  (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exist a permutation $\\pi$ such that $G\\preceq \\pi(H)$?\n  (b) The Spectrally Robust Graph Isomorphism (SRGI) problem: On input of two graphs $G$ and $H$, find the smallest number $\\kappa$ over all permutations $\\pi$ such that $ \\pi(H) \\preceq G\\preceq \\kappa c \\pi(H)$ for some $c$. SRGI is a natural formulation of the network alignment problem that has various applications, most notably in computational biology.\n  Here"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00181","kind":"arxiv","version":1},"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":"1805.00181","created_at":"2026-05-18T00:17:10.365605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00181v1","created_at":"2026-05-18T00:17:10.365605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00181","created_at":"2026-05-18T00:17:10.365605+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4XIUECHVP6G","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4XIUECHVP6GKDQX","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4XIUECH","created_at":"2026-05-18T12:32:59.047623+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/W4XIUECHVP6GKDQXNWJ7CHY4L6","json":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6.json","graph_json":"https://pith.science/api/pith-number/W4XIUECHVP6GKDQXNWJ7CHY4L6/graph.json","events_json":"https://pith.science/api/pith-number/W4XIUECHVP6GKDQXNWJ7CHY4L6/events.json","paper":"https://pith.science/paper/W4XIUECH"},"agent_actions":{"view_html":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6","download_json":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6.json","view_paper":"https://pith.science/paper/W4XIUECH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00181&json=true","fetch_graph":"https://pith.science/api/pith-number/W4XIUECHVP6GKDQXNWJ7CHY4L6/graph.json","fetch_events":"https://pith.science/api/pith-number/W4XIUECHVP6GKDQXNWJ7CHY4L6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6/action/storage_attestation","attest_author":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6/action/author_attestation","sign_citation":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6/action/citation_signature","submit_replication":"https://pith.science/pith/W4XIUECHVP6GKDQXNWJ7CHY4L6/action/replication_record"}},"created_at":"2026-05-18T00:17:10.365605+00:00","updated_at":"2026-05-18T00:17:10.365605+00:00"}