{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:THCGAW3JNVKQC7ZVZE7FY7QCAT","short_pith_number":"pith:THCGAW3J","schema_version":"1.0","canonical_sha256":"99c4605b696d55017f35c93e5c7e0204cf89a45b9415815b8488887e2dc3d653","source":{"kind":"arxiv","id":"2110.09619","version":3},"attestation_state":"computed","paper":{"title":"Further Generalizations of the Jaccard Index","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luciano da F. Costa","submitted_at":"2021-10-18T20:52:38Z","abstract_excerpt":"Quantifying the similarity between two mathematical structures or datasets constitutes a particularly interesting and useful operation in several theoretical and applied problems. Aimed at this specific objective, the Jaccard index has been extensively used in the most diverse types of problems, also motivating some respective generalizations. The present work addresses further generalizations of this index, including its modification into a coincidence index capable of accounting also for the level of relative interiority between the two compared entities, as well as respective extensions for"},"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":"2110.09619","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-18T20:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"d31dd9bea3cd1c99bbcecc247905dd94b82e4722c6558dd351223479692398a2","abstract_canon_sha256":"0e223fd4131d3ae9e24c74eae09934d26f97a27eb1c8935669422c1530ede988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:08.484194Z","signature_b64":"3ZQNkmJlcAYkThNIRm734DFQdbhrUXaMskqGktCHrHNOXzLRkOXGkCN9YurDWxf8CXkRQs7elsDsCuZb2+AgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99c4605b696d55017f35c93e5c7e0204cf89a45b9415815b8488887e2dc3d653","last_reissued_at":"2026-07-05T03:33:08.483742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:08.483742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Generalizations of the Jaccard Index","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luciano da F. Costa","submitted_at":"2021-10-18T20:52:38Z","abstract_excerpt":"Quantifying the similarity between two mathematical structures or datasets constitutes a particularly interesting and useful operation in several theoretical and applied problems. Aimed at this specific objective, the Jaccard index has been extensively used in the most diverse types of problems, also motivating some respective generalizations. The present work addresses further generalizations of this index, including its modification into a coincidence index capable of accounting also for the level of relative interiority between the two compared entities, as well as respective extensions for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.09619","kind":"arxiv","version":3},"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/2110.09619/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":"2110.09619","created_at":"2026-07-05T03:33:08.483793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.09619v3","created_at":"2026-07-05T03:33:08.483793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09619","created_at":"2026-07-05T03:33:08.483793+00:00"},{"alias_kind":"pith_short_12","alias_value":"THCGAW3JNVKQ","created_at":"2026-07-05T03:33:08.483793+00:00"},{"alias_kind":"pith_short_16","alias_value":"THCGAW3JNVKQC7ZV","created_at":"2026-07-05T03:33:08.483793+00:00"},{"alias_kind":"pith_short_8","alias_value":"THCGAW3J","created_at":"2026-07-05T03:33:08.483793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.13724","citing_title":"Heterogeneous Graph Neural Networks with Post-hoc Explanations for Multi-modal and Explainable Land Use Inference","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22760","citing_title":"Quantifying Divergence in Inter-LLM Communication Through API Retrieval and Ranking","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT","json":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT.json","graph_json":"https://pith.science/api/pith-number/THCGAW3JNVKQC7ZVZE7FY7QCAT/graph.json","events_json":"https://pith.science/api/pith-number/THCGAW3JNVKQC7ZVZE7FY7QCAT/events.json","paper":"https://pith.science/paper/THCGAW3J"},"agent_actions":{"view_html":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT","download_json":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT.json","view_paper":"https://pith.science/paper/THCGAW3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.09619&json=true","fetch_graph":"https://pith.science/api/pith-number/THCGAW3JNVKQC7ZVZE7FY7QCAT/graph.json","fetch_events":"https://pith.science/api/pith-number/THCGAW3JNVKQC7ZVZE7FY7QCAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT/action/storage_attestation","attest_author":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT/action/author_attestation","sign_citation":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT/action/citation_signature","submit_replication":"https://pith.science/pith/THCGAW3JNVKQC7ZVZE7FY7QCAT/action/replication_record"}},"created_at":"2026-07-05T03:33:08.483793+00:00","updated_at":"2026-07-05T03:33:08.483793+00:00"}