{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:STRH4P72DUSWZ65547F7VEXFWH","short_pith_number":"pith:STRH4P72","schema_version":"1.0","canonical_sha256":"94e27e3ffa1d256cfbbde7cbfa92e5b1e2e8c7efe5920af06e16350b33ded06d","source":{"kind":"arxiv","id":"1703.10819","version":4},"attestation_state":"computed","paper":{"title":"A note on graphs with disjoint maximal cliques ans a link with evasiveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertrand Jouve, Etienne Fieux","submitted_at":"2017-03-31T09:50:26Z","abstract_excerpt":"In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and Payan. It also gives a positive answer to a special case of the evasiveness conjecture."},"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":"1703.10819","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T09:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"3df2bde03ba7347f835081ce33881553856a03cd15d50cf8ce5b461d968a417c","abstract_canon_sha256":"72204e6602eccd3c20310730db0491cf67600b6a31b7203f76af563cc39af4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:29.338480Z","signature_b64":"t6VUACgDiNO+IUmoQgVC4vZR5sIpC+nm//eE2INeeB7D2yjMiMhftjzZmvgPE1sujbuby8Yhq335wX1GJi93Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e27e3ffa1d256cfbbde7cbfa92e5b1e2e8c7efe5920af06e16350b33ded06d","last_reissued_at":"2026-05-18T00:22:29.337816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:29.337816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on graphs with disjoint maximal cliques ans a link with evasiveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertrand Jouve, Etienne Fieux","submitted_at":"2017-03-31T09:50:26Z","abstract_excerpt":"In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and Payan. It also gives a positive answer to a special case of the evasiveness conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10819","kind":"arxiv","version":4},"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":"1703.10819","created_at":"2026-05-18T00:22:29.337934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10819v4","created_at":"2026-05-18T00:22:29.337934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10819","created_at":"2026-05-18T00:22:29.337934+00:00"},{"alias_kind":"pith_short_12","alias_value":"STRH4P72DUSW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"STRH4P72DUSWZ655","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"STRH4P72","created_at":"2026-05-18T12:31:43.269735+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/STRH4P72DUSWZ65547F7VEXFWH","json":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH.json","graph_json":"https://pith.science/api/pith-number/STRH4P72DUSWZ65547F7VEXFWH/graph.json","events_json":"https://pith.science/api/pith-number/STRH4P72DUSWZ65547F7VEXFWH/events.json","paper":"https://pith.science/paper/STRH4P72"},"agent_actions":{"view_html":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH","download_json":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH.json","view_paper":"https://pith.science/paper/STRH4P72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10819&json=true","fetch_graph":"https://pith.science/api/pith-number/STRH4P72DUSWZ65547F7VEXFWH/graph.json","fetch_events":"https://pith.science/api/pith-number/STRH4P72DUSWZ65547F7VEXFWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH/action/storage_attestation","attest_author":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH/action/author_attestation","sign_citation":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH/action/citation_signature","submit_replication":"https://pith.science/pith/STRH4P72DUSWZ65547F7VEXFWH/action/replication_record"}},"created_at":"2026-05-18T00:22:29.337934+00:00","updated_at":"2026-05-18T00:22:29.337934+00:00"}