{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MP7LTJYAGCESKZMUYJ67OBZB5R","short_pith_number":"pith:MP7LTJYA","schema_version":"1.0","canonical_sha256":"63feb9a7003089256594c27df70721ec6b0d6a8d5099deb2cf52bb61b47f39a7","source":{"kind":"arxiv","id":"2412.17074","version":1},"attestation_state":"computed","paper":{"title":"Interplay between the local metric dimension and the clique number of a graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Ghalavand, Sandi Klav\\v{z}ar, Xueliang Li","submitted_at":"2024-12-22T15:54:50Z","abstract_excerpt":"The local metric dimension ${\\rm dim}_l$ in relation to the clique number $\\omega$ is investigated. It is proved that if $\\omega(G)\\leq n(G)-3$, then ${\\rm dim}_l(G) \\leq n(G)-3$ and the graphs attaining the bound classified. Moreover, the graphs $G$ with ${\\rm dim}_l(G) = n(G)-3$ are listed (with no condition on the clique number). It is proved that if $\\omega(G)=n(G)-2$, then $n(G)-4 \\leq {\\rm dim}_l(G)\\leq n(G)-3$, and all graphs are divided into two groups depending on which of the options applies. The conjecture asserting that for any graph $G$ we have ${\\rm dim}_l(G) \\leq \\left[(\\omega(G"},"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":"2412.17074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-22T15:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"53ba518aa0be6fb7a96b56c00bd14e7d02e992210be52155a7f08db68097ced8","abstract_canon_sha256":"eaed888843484791c76819ed7e1cf48568ab3ef9796ae54d18c8db534abe5b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:17.264207Z","signature_b64":"3MgHg314KlXk0kC/EyROQkg+kSxUvRALTwAbgwfP35uFGQJ3dR96VMD5OIJ2MYQaZ3O2bvIg1SYTCtUgGYlmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63feb9a7003089256594c27df70721ec6b0d6a8d5099deb2cf52bb61b47f39a7","last_reissued_at":"2026-07-05T09:53:17.263744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:17.263744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interplay between the local metric dimension and the clique number of a graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Ghalavand, Sandi Klav\\v{z}ar, Xueliang Li","submitted_at":"2024-12-22T15:54:50Z","abstract_excerpt":"The local metric dimension ${\\rm dim}_l$ in relation to the clique number $\\omega$ is investigated. It is proved that if $\\omega(G)\\leq n(G)-3$, then ${\\rm dim}_l(G) \\leq n(G)-3$ and the graphs attaining the bound classified. Moreover, the graphs $G$ with ${\\rm dim}_l(G) = n(G)-3$ are listed (with no condition on the clique number). It is proved that if $\\omega(G)=n(G)-2$, then $n(G)-4 \\leq {\\rm dim}_l(G)\\leq n(G)-3$, and all graphs are divided into two groups depending on which of the options applies. The conjecture asserting that for any graph $G$ we have ${\\rm dim}_l(G) \\leq \\left[(\\omega(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17074","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/2412.17074/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":"2412.17074","created_at":"2026-07-05T09:53:17.263801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17074v1","created_at":"2026-07-05T09:53:17.263801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17074","created_at":"2026-07-05T09:53:17.263801+00:00"},{"alias_kind":"pith_short_12","alias_value":"MP7LTJYAGCES","created_at":"2026-07-05T09:53:17.263801+00:00"},{"alias_kind":"pith_short_16","alias_value":"MP7LTJYAGCESKZMU","created_at":"2026-07-05T09:53:17.263801+00:00"},{"alias_kind":"pith_short_8","alias_value":"MP7LTJYA","created_at":"2026-07-05T09:53:17.263801+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13777","citing_title":"Intertwining local (adjacency) metric dimension with the clique number of a graph","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R","json":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R.json","graph_json":"https://pith.science/api/pith-number/MP7LTJYAGCESKZMUYJ67OBZB5R/graph.json","events_json":"https://pith.science/api/pith-number/MP7LTJYAGCESKZMUYJ67OBZB5R/events.json","paper":"https://pith.science/paper/MP7LTJYA"},"agent_actions":{"view_html":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R","download_json":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R.json","view_paper":"https://pith.science/paper/MP7LTJYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17074&json=true","fetch_graph":"https://pith.science/api/pith-number/MP7LTJYAGCESKZMUYJ67OBZB5R/graph.json","fetch_events":"https://pith.science/api/pith-number/MP7LTJYAGCESKZMUYJ67OBZB5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R/action/storage_attestation","attest_author":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R/action/author_attestation","sign_citation":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R/action/citation_signature","submit_replication":"https://pith.science/pith/MP7LTJYAGCESKZMUYJ67OBZB5R/action/replication_record"}},"created_at":"2026-07-05T09:53:17.263801+00:00","updated_at":"2026-07-05T09:53:17.263801+00:00"}