{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CBQYC65I3XA5HDAT36ITQTNNY3","short_pith_number":"pith:CBQYC65I","schema_version":"1.0","canonical_sha256":"1061817ba8ddc1d38c13df91384dadc6d3099d4dd935d53804df1d5527e2d6b5","source":{"kind":"arxiv","id":"1709.05800","version":1},"attestation_state":"computed","paper":{"title":"Unification of graph products and compatibility with switching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sho Kubota","submitted_at":"2017-09-18T07:55:28Z","abstract_excerpt":"We define the type of graph products, which enable us to treat many graph products in a unified manner. These unified graph products are shown to be compatible with Godsil--McKay switching. Furthermore, by this compatibility, we show that the Doob graphs can also be obtained from the Hamming graphs by switching."},"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":"1709.05800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T07:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"b86ecf8ea79894d871423a3b055fac79468915a0b3c677fae8b19585166a9645","abstract_canon_sha256":"65db798ed32e802cd718cba53fe096a61403dd5157901b759bda02c65337eba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.347571Z","signature_b64":"O7RgcTJPrEB5fcKEmuZ3VS8exo970kKU0yhelZXpPunVo+pp1xZvLNOJCLWSrkgYAYG/61rjs2bvACWdXyKeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1061817ba8ddc1d38c13df91384dadc6d3099d4dd935d53804df1d5527e2d6b5","last_reissued_at":"2026-05-18T00:34:59.346839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.346839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unification of graph products and compatibility with switching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sho Kubota","submitted_at":"2017-09-18T07:55:28Z","abstract_excerpt":"We define the type of graph products, which enable us to treat many graph products in a unified manner. These unified graph products are shown to be compatible with Godsil--McKay switching. Furthermore, by this compatibility, we show that the Doob graphs can also be obtained from the Hamming graphs by switching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05800","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":"1709.05800","created_at":"2026-05-18T00:34:59.346950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05800v1","created_at":"2026-05-18T00:34:59.346950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05800","created_at":"2026-05-18T00:34:59.346950+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBQYC65I3XA5","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBQYC65I3XA5HDAT","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBQYC65I","created_at":"2026-05-18T12:31:10.602751+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/CBQYC65I3XA5HDAT36ITQTNNY3","json":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3.json","graph_json":"https://pith.science/api/pith-number/CBQYC65I3XA5HDAT36ITQTNNY3/graph.json","events_json":"https://pith.science/api/pith-number/CBQYC65I3XA5HDAT36ITQTNNY3/events.json","paper":"https://pith.science/paper/CBQYC65I"},"agent_actions":{"view_html":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3","download_json":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3.json","view_paper":"https://pith.science/paper/CBQYC65I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05800&json=true","fetch_graph":"https://pith.science/api/pith-number/CBQYC65I3XA5HDAT36ITQTNNY3/graph.json","fetch_events":"https://pith.science/api/pith-number/CBQYC65I3XA5HDAT36ITQTNNY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3/action/storage_attestation","attest_author":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3/action/author_attestation","sign_citation":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3/action/citation_signature","submit_replication":"https://pith.science/pith/CBQYC65I3XA5HDAT36ITQTNNY3/action/replication_record"}},"created_at":"2026-05-18T00:34:59.346950+00:00","updated_at":"2026-05-18T00:34:59.346950+00:00"}