{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XKEJUDVIAZP5F3FOPT2ESK7X5H","short_pith_number":"pith:XKEJUDVI","schema_version":"1.0","canonical_sha256":"ba889a0ea8065fd2ecae7cf4492bf7e9e2b0950f2babfaeed217e872aafe4c14","source":{"kind":"arxiv","id":"2607.07939","version":1},"attestation_state":"computed","paper":{"title":"Dimension and Order Bounds for Isometric Embeddings of Graphs into Abelian Cayley Graphs, and the Abelian Dividend","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bitjoka Laurent, Fokam Souop Rigobert","submitted_at":"2026-07-08T21:35:08Z","abstract_excerpt":"We investigate the minimum size of finite abelian Cayley graphs that admit an isometric embedding of a finite connected graph. While every connected graph on n vertices embeds isometrically into a binary Cayley graph of dimension at most n-1, the smallest possible abelian host has remained largely unexplored. We establish fundamental lower bounds showing that every binary host has dimension at least max(diam(G), floor(log2 n)), whereas every finite abelian host has order at least max(n, 2^diam(G)). Moreover, we prove that the minimum host order equals n if and only if G is itself an abelian Ca"},"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":"2607.07939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T21:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"c13e1507a34ba7c3aeef9996956bb6dd673b5f96583a779ec9e865a18fced474","abstract_canon_sha256":"80b7143c3f9323325c4f97d2a47cfd65e1fd4ee0f5c93ba1465668874fe11e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T00:19:05.391873Z","signature_b64":"A582351fC4/ttPoXMcyqXU/z4kW/jHq1d3G1tYMT/VfSagKyfupltp0kbCF9DWJWNCKU4jVO3NSi1C20pbX+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba889a0ea8065fd2ecae7cf4492bf7e9e2b0950f2babfaeed217e872aafe4c14","last_reissued_at":"2026-07-10T00:19:05.391447Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T00:19:05.391447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dimension and Order Bounds for Isometric Embeddings of Graphs into Abelian Cayley Graphs, and the Abelian Dividend","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bitjoka Laurent, Fokam Souop Rigobert","submitted_at":"2026-07-08T21:35:08Z","abstract_excerpt":"We investigate the minimum size of finite abelian Cayley graphs that admit an isometric embedding of a finite connected graph. While every connected graph on n vertices embeds isometrically into a binary Cayley graph of dimension at most n-1, the smallest possible abelian host has remained largely unexplored. We establish fundamental lower bounds showing that every binary host has dimension at least max(diam(G), floor(log2 n)), whereas every finite abelian host has order at least max(n, 2^diam(G)). Moreover, we prove that the minimum host order equals n if and only if G is itself an abelian Ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07939","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/2607.07939/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":"2607.07939","created_at":"2026-07-10T00:19:05.391511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07939v1","created_at":"2026-07-10T00:19:05.391511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07939","created_at":"2026-07-10T00:19:05.391511+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKEJUDVIAZP5","created_at":"2026-07-10T00:19:05.391511+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKEJUDVIAZP5F3FO","created_at":"2026-07-10T00:19:05.391511+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKEJUDVI","created_at":"2026-07-10T00:19:05.391511+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/XKEJUDVIAZP5F3FOPT2ESK7X5H","json":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H.json","graph_json":"https://pith.science/api/pith-number/XKEJUDVIAZP5F3FOPT2ESK7X5H/graph.json","events_json":"https://pith.science/api/pith-number/XKEJUDVIAZP5F3FOPT2ESK7X5H/events.json","paper":"https://pith.science/paper/XKEJUDVI"},"agent_actions":{"view_html":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H","download_json":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H.json","view_paper":"https://pith.science/paper/XKEJUDVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07939&json=true","fetch_graph":"https://pith.science/api/pith-number/XKEJUDVIAZP5F3FOPT2ESK7X5H/graph.json","fetch_events":"https://pith.science/api/pith-number/XKEJUDVIAZP5F3FOPT2ESK7X5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H/action/storage_attestation","attest_author":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H/action/author_attestation","sign_citation":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H/action/citation_signature","submit_replication":"https://pith.science/pith/XKEJUDVIAZP5F3FOPT2ESK7X5H/action/replication_record"}},"created_at":"2026-07-10T00:19:05.391511+00:00","updated_at":"2026-07-10T00:19:05.391511+00:00"}