{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IWFHLEHZDHGELN3X2M27WKGXXI","short_pith_number":"pith:IWFHLEHZ","schema_version":"1.0","canonical_sha256":"458a7590f919cc45b777d335fb28d7ba38ccab9fdbd225fd5ac41088a8dfc529","source":{"kind":"arxiv","id":"1512.05113","version":2},"attestation_state":"computed","paper":{"title":"$K_{3,3}$-free Intersection Graphs of Finite Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Sel\\c{c}uk Kayacan","submitted_at":"2015-12-16T10:23:22Z","abstract_excerpt":"The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$ and $K$ if and only if $H\\cap K \\neq 1$ where $1$ denotes the trivial subgroup of $G$. In this paper we classify all finite groups whose intersection graphs are $K_{3,3}$-free."},"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":"1512.05113","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-12-16T10:23:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4322705837a0320978bf46d90d294359fed188d7f442b4764d07893f1e882617","abstract_canon_sha256":"17ab533786b381d7033068c7f9e8d1148e65d41514795663c755d893253a6796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:07.865647Z","signature_b64":"SffKAXUYbdDP6424jrk9X3wiT43RtuBavq6CK4yMhHBHEFLb5Ph+1tUbrohF0aMbPcacWXTZpF7ypVYD5FQXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"458a7590f919cc45b777d335fb28d7ba38ccab9fdbd225fd5ac41088a8dfc529","last_reissued_at":"2026-05-18T01:10:07.864932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:07.864932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$K_{3,3}$-free Intersection Graphs of Finite Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Sel\\c{c}uk Kayacan","submitted_at":"2015-12-16T10:23:22Z","abstract_excerpt":"The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$ and $K$ if and only if $H\\cap K \\neq 1$ where $1$ denotes the trivial subgroup of $G$. In this paper we classify all finite groups whose intersection graphs are $K_{3,3}$-free."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05113","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":"1512.05113","created_at":"2026-05-18T01:10:07.865044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05113v2","created_at":"2026-05-18T01:10:07.865044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05113","created_at":"2026-05-18T01:10:07.865044+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWFHLEHZDHGE","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWFHLEHZDHGELN3X","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWFHLEHZ","created_at":"2026-05-18T12:29:27.538025+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/IWFHLEHZDHGELN3X2M27WKGXXI","json":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI.json","graph_json":"https://pith.science/api/pith-number/IWFHLEHZDHGELN3X2M27WKGXXI/graph.json","events_json":"https://pith.science/api/pith-number/IWFHLEHZDHGELN3X2M27WKGXXI/events.json","paper":"https://pith.science/paper/IWFHLEHZ"},"agent_actions":{"view_html":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI","download_json":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI.json","view_paper":"https://pith.science/paper/IWFHLEHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05113&json=true","fetch_graph":"https://pith.science/api/pith-number/IWFHLEHZDHGELN3X2M27WKGXXI/graph.json","fetch_events":"https://pith.science/api/pith-number/IWFHLEHZDHGELN3X2M27WKGXXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI/action/storage_attestation","attest_author":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI/action/author_attestation","sign_citation":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI/action/citation_signature","submit_replication":"https://pith.science/pith/IWFHLEHZDHGELN3X2M27WKGXXI/action/replication_record"}},"created_at":"2026-05-18T01:10:07.865044+00:00","updated_at":"2026-05-18T01:10:07.865044+00:00"}