{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6QJ7F3IYFQJH2XL22BXELVDK2T","short_pith_number":"pith:6QJ7F3IY","schema_version":"1.0","canonical_sha256":"f413f2ed182c127d5d7ad06e45d46ad4fb36cb2a50d30f86a3f134b465546c7c","source":{"kind":"arxiv","id":"2410.07019","version":1},"attestation_state":"computed","paper":{"title":"Graph identification index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Runze Wang","submitted_at":"2024-10-09T16:03:28Z","abstract_excerpt":"We introduce the \\emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\\ E)$ with diameter $d$, we let $f:V\\longrightarrow \\mathbb{R}$ assign \\emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a \\emph{string}, which is a $d$-vector with the $i$-th coordinate being the sum of the ranks of the vertices that are of distance $i$ from $v$. The \\emph{ID-index} of $G$, denoted by $IDI(G)$, is defined to be the minimum number $k$ for which there is an $f$ with $|f(V)|=k$, such that each vertex gets a distinct string under $f$. We present some relations between ID-graphs"},"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":"2410.07019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T16:03:28Z","cross_cats_sorted":[],"title_canon_sha256":"0b6d79d1d7b49581b0a040bf3067d4a2ceef19885c1a6cdc6be94ec9a99bb2c0","abstract_canon_sha256":"80937eb7e6760e7c82ae73d687e655cd6b66c952d0d41c64ce46da93a169f8de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:09.712393Z","signature_b64":"ZQSC9tyt6+8Oxq0VzNUIRie9rxdsks181sAQulKfeByL0NU5GinpjnRfh4uitfpSUljMWu0cHCrfY/m+x6rFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f413f2ed182c127d5d7ad06e45d46ad4fb36cb2a50d30f86a3f134b465546c7c","last_reissued_at":"2026-07-05T09:18:09.711926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:09.711926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph identification index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Runze Wang","submitted_at":"2024-10-09T16:03:28Z","abstract_excerpt":"We introduce the \\emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\\ E)$ with diameter $d$, we let $f:V\\longrightarrow \\mathbb{R}$ assign \\emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a \\emph{string}, which is a $d$-vector with the $i$-th coordinate being the sum of the ranks of the vertices that are of distance $i$ from $v$. The \\emph{ID-index} of $G$, denoted by $IDI(G)$, is defined to be the minimum number $k$ for which there is an $f$ with $|f(V)|=k$, such that each vertex gets a distinct string under $f$. We present some relations between ID-graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07019","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/2410.07019/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":"2410.07019","created_at":"2026-07-05T09:18:09.711977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07019v1","created_at":"2026-07-05T09:18:09.711977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07019","created_at":"2026-07-05T09:18:09.711977+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QJ7F3IYFQJH","created_at":"2026-07-05T09:18:09.711977+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QJ7F3IYFQJH2XL2","created_at":"2026-07-05T09:18:09.711977+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QJ7F3IY","created_at":"2026-07-05T09:18:09.711977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08128","citing_title":"A Survey on Multiset Dimension and Its Variations","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T","json":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T.json","graph_json":"https://pith.science/api/pith-number/6QJ7F3IYFQJH2XL22BXELVDK2T/graph.json","events_json":"https://pith.science/api/pith-number/6QJ7F3IYFQJH2XL22BXELVDK2T/events.json","paper":"https://pith.science/paper/6QJ7F3IY"},"agent_actions":{"view_html":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T","download_json":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T.json","view_paper":"https://pith.science/paper/6QJ7F3IY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07019&json=true","fetch_graph":"https://pith.science/api/pith-number/6QJ7F3IYFQJH2XL22BXELVDK2T/graph.json","fetch_events":"https://pith.science/api/pith-number/6QJ7F3IYFQJH2XL22BXELVDK2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T/action/storage_attestation","attest_author":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T/action/author_attestation","sign_citation":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T/action/citation_signature","submit_replication":"https://pith.science/pith/6QJ7F3IYFQJH2XL22BXELVDK2T/action/replication_record"}},"created_at":"2026-07-05T09:18:09.711977+00:00","updated_at":"2026-07-05T09:18:09.711977+00:00"}