{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V4JULZ2YZLEJYBYCXQ4PWG4FGA","short_pith_number":"pith:V4JULZ2Y","canonical_record":{"source":{"id":"2507.13777","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T09:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"91309cf58f688461357180c94e618f5ebac4e865977e0f104b7a29bf5106eed6","abstract_canon_sha256":"94b9428f4650a103a8c967fdf5fd65662d30351eafc28b42f826c587cf62e99f"},"schema_version":"1.0"},"canonical_sha256":"af1345e758cac89c0702bc38fb1b853018381aeed2bfd7792c44d548972afde8","source":{"kind":"arxiv","id":"2507.13777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13777","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13777v1","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13777","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"V4JULZ2YZLEJ","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_16","alias_value":"V4JULZ2YZLEJYBYC","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_8","alias_value":"V4JULZ2Y","created_at":"2026-07-05T11:39:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V4JULZ2YZLEJYBYCXQ4PWG4FGA","target":"record","payload":{"canonical_record":{"source":{"id":"2507.13777","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T09:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"91309cf58f688461357180c94e618f5ebac4e865977e0f104b7a29bf5106eed6","abstract_canon_sha256":"94b9428f4650a103a8c967fdf5fd65662d30351eafc28b42f826c587cf62e99f"},"schema_version":"1.0"},"canonical_sha256":"af1345e758cac89c0702bc38fb1b853018381aeed2bfd7792c44d548972afde8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:22.832299Z","signature_b64":"ozVcGe5J45GgvhqLObWilC2UCXjLeIpJYOPWgcGTOoul3DcvniS5EEyWMvzFsXw1JDuo8vZI2MBDWuvKOOWsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1345e758cac89c0702bc38fb1b853018381aeed2bfd7792c44d548972afde8","last_reissued_at":"2026-07-05T11:39:22.831816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:22.831816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.13777","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKU3PToH2w29Lk4zT+CykICYmgK9rBE+nPZfWfLrCtLwg7GfTJdr1mgFqPAR8rNsWA4SFGgHKAddcc5x6LJoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:03:32.308691Z"},"content_sha256":"02813be7670c6c7ab4865ed44a2b79afb70efb20e307dc9057938cd857d8be8d","schema_version":"1.0","event_id":"sha256:02813be7670c6c7ab4865ed44a2b79afb70efb20e307dc9057938cd857d8be8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V4JULZ2YZLEJYBYCXQ4PWG4FGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intertwining local (adjacency) metric dimension with 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":"2025-07-18T09:36:29Z","abstract_excerpt":"Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\\rm dim}_l(G)$, local adjacency metric dimension $ {\\rm dim}_{A,l}(G)$, and clique number $ \\omega(G)$, where $G\\not\\cong K_{n(G)}$ and $\\omega(G)\\geq3$. It is proved that $ {\\rm dim}_{A,l}(G) \\leq \\left\\lfloor \\left(\\frac{\\omega(G) - 2}{\\omega(G) - 1}\\right)n(G)\\right\\rfloor$. Consequently, the conjecture asserting that the latter expression is an upper bound for ${\\rm dim}_l(G)$ is confirmed. It is important to note that there are infinitely many graphs that satisfy the equalities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13777","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/2507.13777/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/cW7KBcbP791M3yZuvt2qrgZ1dE5AZPHewzrEij43y+U5fcRWozMI/mMQTikzY3QkrTrOzUIqWNpyxuBu+XwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:03:32.309231Z"},"content_sha256":"c00eca12633e644d69ada51a81190ab83a5eefa364b050d079f310ac761343e7","schema_version":"1.0","event_id":"sha256:c00eca12633e644d69ada51a81190ab83a5eefa364b050d079f310ac761343e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/bundle.json","state_url":"https://pith.science/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T22:03:32Z","links":{"resolver":"https://pith.science/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA","bundle":"https://pith.science/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/bundle.json","state":"https://pith.science/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4JULZ2YZLEJYBYCXQ4PWG4FGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V4JULZ2YZLEJYBYCXQ4PWG4FGA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"94b9428f4650a103a8c967fdf5fd65662d30351eafc28b42f826c587cf62e99f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T09:36:29Z","title_canon_sha256":"91309cf58f688461357180c94e618f5ebac4e865977e0f104b7a29bf5106eed6"},"schema_version":"1.0","source":{"id":"2507.13777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13777","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13777v1","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13777","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"V4JULZ2YZLEJ","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_16","alias_value":"V4JULZ2YZLEJYBYC","created_at":"2026-07-05T11:39:22Z"},{"alias_kind":"pith_short_8","alias_value":"V4JULZ2Y","created_at":"2026-07-05T11:39:22Z"}],"graph_snapshots":[{"event_id":"sha256:c00eca12633e644d69ada51a81190ab83a5eefa364b050d079f310ac761343e7","target":"graph","created_at":"2026-07-05T11:39:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.13777/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\\rm dim}_l(G)$, local adjacency metric dimension $ {\\rm dim}_{A,l}(G)$, and clique number $ \\omega(G)$, where $G\\not\\cong K_{n(G)}$ and $\\omega(G)\\geq3$. It is proved that $ {\\rm dim}_{A,l}(G) \\leq \\left\\lfloor \\left(\\frac{\\omega(G) - 2}{\\omega(G) - 1}\\right)n(G)\\right\\rfloor$. Consequently, the conjecture asserting that the latter expression is an upper bound for ${\\rm dim}_l(G)$ is confirmed. It is important to note that there are infinitely many graphs that satisfy the equalities.","authors_text":"Ali Ghalavand, Sandi Klav\\v{z}ar, Xueliang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T09:36:29Z","title":"Intertwining local (adjacency) metric dimension with the clique number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13777","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02813be7670c6c7ab4865ed44a2b79afb70efb20e307dc9057938cd857d8be8d","target":"record","created_at":"2026-07-05T11:39:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"94b9428f4650a103a8c967fdf5fd65662d30351eafc28b42f826c587cf62e99f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T09:36:29Z","title_canon_sha256":"91309cf58f688461357180c94e618f5ebac4e865977e0f104b7a29bf5106eed6"},"schema_version":"1.0","source":{"id":"2507.13777","kind":"arxiv","version":1}},"canonical_sha256":"af1345e758cac89c0702bc38fb1b853018381aeed2bfd7792c44d548972afde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af1345e758cac89c0702bc38fb1b853018381aeed2bfd7792c44d548972afde8","first_computed_at":"2026-07-05T11:39:22.831816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:22.831816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozVcGe5J45GgvhqLObWilC2UCXjLeIpJYOPWgcGTOoul3DcvniS5EEyWMvzFsXw1JDuo8vZI2MBDWuvKOOWsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:22.832299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02813be7670c6c7ab4865ed44a2b79afb70efb20e307dc9057938cd857d8be8d","sha256:c00eca12633e644d69ada51a81190ab83a5eefa364b050d079f310ac761343e7"],"state_sha256":"1e3d05c4f9083b804d90fa28ca432e974f72f7f7ac0236272d4f89036bb72c8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A00SSd3BD147z9duu5ska+ZZXEr3fKmE1PYb8Yv7M371qAlafffLHjoF25I78x4QdrSFzI8N7l+MJOlFIXZvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:03:32.314483Z","bundle_sha256":"3c662670f142f05a0f1138283487ae8c0c61806192a23410c4a661dbf50cdcb1"}}