{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C777F2I6NVIZ2KQTLB5KRLX7VL","short_pith_number":"pith:C777F2I6","schema_version":"1.0","canonical_sha256":"17fff2e91e6d519d2a13587aa8aeffaafc26fd29ecd03a651828359c1db25cef","source":{"kind":"arxiv","id":"1405.3102","version":1},"attestation_state":"computed","paper":{"title":"G-graphs Characterisation and Incidence Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cerasela Tanasescu, David Ellison, Ruxandra Marinescu-Ghemeci","submitted_at":"2014-05-13T11:04:58Z","abstract_excerpt":"Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the main properties of these graphs, this papers gives an extended characterisation of G-graphs and develops the link between bipartite G-graphs and incidence graphs. It appears that these two classes of graphs have a wide overlapping despite having completely different constructions. We give partial answers to the problem of finding which complete simple graphs ha"},"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":"1405.3102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T11:04:58Z","cross_cats_sorted":[],"title_canon_sha256":"1b06bc78135dbdf7dbca5f1b87893b27143e68a4b413c07388fbc00806634b7a","abstract_canon_sha256":"5963b0f394deb92e3b7ff24d5c1530d49af337f25bd99d7102a4f24e64b21f9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.254110Z","signature_b64":"6r8MyeZB/lfq9EzBJzrGEAesMwsxIZTXQn2ir5kfLbzB/G2ot2yFVZ7zVrOMXZ97XJ/oueiLAij/Xy7nNu3FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17fff2e91e6d519d2a13587aa8aeffaafc26fd29ecd03a651828359c1db25cef","last_reissued_at":"2026-05-18T00:56:59.253583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.253583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G-graphs Characterisation and Incidence Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cerasela Tanasescu, David Ellison, Ruxandra Marinescu-Ghemeci","submitted_at":"2014-05-13T11:04:58Z","abstract_excerpt":"Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the main properties of these graphs, this papers gives an extended characterisation of G-graphs and develops the link between bipartite G-graphs and incidence graphs. It appears that these two classes of graphs have a wide overlapping despite having completely different constructions. We give partial answers to the problem of finding which complete simple graphs ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3102","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":"1405.3102","created_at":"2026-05-18T00:56:59.253677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3102v1","created_at":"2026-05-18T00:56:59.253677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3102","created_at":"2026-05-18T00:56:59.253677+00:00"},{"alias_kind":"pith_short_12","alias_value":"C777F2I6NVIZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C777F2I6NVIZ2KQT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C777F2I6","created_at":"2026-05-18T12:28:22.404517+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/C777F2I6NVIZ2KQTLB5KRLX7VL","json":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL.json","graph_json":"https://pith.science/api/pith-number/C777F2I6NVIZ2KQTLB5KRLX7VL/graph.json","events_json":"https://pith.science/api/pith-number/C777F2I6NVIZ2KQTLB5KRLX7VL/events.json","paper":"https://pith.science/paper/C777F2I6"},"agent_actions":{"view_html":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL","download_json":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL.json","view_paper":"https://pith.science/paper/C777F2I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3102&json=true","fetch_graph":"https://pith.science/api/pith-number/C777F2I6NVIZ2KQTLB5KRLX7VL/graph.json","fetch_events":"https://pith.science/api/pith-number/C777F2I6NVIZ2KQTLB5KRLX7VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL/action/storage_attestation","attest_author":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL/action/author_attestation","sign_citation":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL/action/citation_signature","submit_replication":"https://pith.science/pith/C777F2I6NVIZ2KQTLB5KRLX7VL/action/replication_record"}},"created_at":"2026-05-18T00:56:59.253677+00:00","updated_at":"2026-05-18T00:56:59.253677+00:00"}