{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LFLKKWOYBTUEMCDFTETW5LF762","short_pith_number":"pith:LFLKKWOY","schema_version":"1.0","canonical_sha256":"5956a559d80ce846086599276eacbff69e1c24aaa3b38717f39412fb6c92f2ed","source":{"kind":"arxiv","id":"2406.01504","version":1},"attestation_state":"computed","paper":{"title":"\\v{S}olt\\'es' hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stijn Cambie","submitted_at":"2024-06-03T16:31:25Z","abstract_excerpt":"More than $30$ years ago, \\v{S}olt\\'es observed that the total distance of the graph $C_{11}$ does not change by deleting a vertex, and wondered about the existence of other such graphs, called \\v{S}olt\\'es graphs. We extend the definition of \\v{S}olt\\'es' graphs to \\v{S}olt\\'es' hypergraphs, determine all orders for which a \\v{S}olt\\'es' hypergraph exists, observe infinitely many uniform \\v{S}olt\\'es' hypergraphs, and find the \\v{S}olt\\'es' hypergraph with minimum size (spoiler: it is not $C_{11}$)."},"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":"2406.01504","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-03T16:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"794687f8bf533444caab2fcfdfbe7f34323391d994dbd02ba395c7ee5226feb0","abstract_canon_sha256":"30f47198070cd7b5e4e51b4c37e338fc8c8fe6d08fffbc3de75e29fedd4a5631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:40.577977Z","signature_b64":"WEkcT5BbAF52+vDyUUnXRMqjaaFD13NSwx1gPXhxp7Kwp7v1xKf9E8LuEBxXedDz2XiAZvE0LTtXhwIt+itJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5956a559d80ce846086599276eacbff69e1c24aaa3b38717f39412fb6c92f2ed","last_reissued_at":"2026-07-05T08:26:40.577457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:40.577457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\\v{S}olt\\'es' hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stijn Cambie","submitted_at":"2024-06-03T16:31:25Z","abstract_excerpt":"More than $30$ years ago, \\v{S}olt\\'es observed that the total distance of the graph $C_{11}$ does not change by deleting a vertex, and wondered about the existence of other such graphs, called \\v{S}olt\\'es graphs. We extend the definition of \\v{S}olt\\'es' graphs to \\v{S}olt\\'es' hypergraphs, determine all orders for which a \\v{S}olt\\'es' hypergraph exists, observe infinitely many uniform \\v{S}olt\\'es' hypergraphs, and find the \\v{S}olt\\'es' hypergraph with minimum size (spoiler: it is not $C_{11}$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01504","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.01504/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.01504","created_at":"2026-07-05T08:26:40.577518+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01504v1","created_at":"2026-07-05T08:26:40.577518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01504","created_at":"2026-07-05T08:26:40.577518+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFLKKWOYBTUE","created_at":"2026-07-05T08:26:40.577518+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFLKKWOYBTUEMCDF","created_at":"2026-07-05T08:26:40.577518+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFLKKWOY","created_at":"2026-07-05T08:26:40.577518+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07511","citing_title":"Uniform \\v{S}olt\\'es' hypergraphs and \\v{S}olt\\'es' weighted graphs","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762","json":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762.json","graph_json":"https://pith.science/api/pith-number/LFLKKWOYBTUEMCDFTETW5LF762/graph.json","events_json":"https://pith.science/api/pith-number/LFLKKWOYBTUEMCDFTETW5LF762/events.json","paper":"https://pith.science/paper/LFLKKWOY"},"agent_actions":{"view_html":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762","download_json":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762.json","view_paper":"https://pith.science/paper/LFLKKWOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01504&json=true","fetch_graph":"https://pith.science/api/pith-number/LFLKKWOYBTUEMCDFTETW5LF762/graph.json","fetch_events":"https://pith.science/api/pith-number/LFLKKWOYBTUEMCDFTETW5LF762/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762/action/storage_attestation","attest_author":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762/action/author_attestation","sign_citation":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762/action/citation_signature","submit_replication":"https://pith.science/pith/LFLKKWOYBTUEMCDFTETW5LF762/action/replication_record"}},"created_at":"2026-07-05T08:26:40.577518+00:00","updated_at":"2026-07-05T08:26:40.577518+00:00"}