{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6WDF6KSC5NHNZEZ7E6EAVB42AP","short_pith_number":"pith:6WDF6KSC","schema_version":"1.0","canonical_sha256":"f5865f2a42eb4edc933f27880a879a03deb4ed60099be1b37d4977dffc3f71f1","source":{"kind":"arxiv","id":"1601.05922","version":1},"attestation_state":"computed","paper":{"title":"Partial order similarity based on mutual information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Gergely Palla, Gergely Tib\\'ely, P\\'eter Pollner","submitted_at":"2016-01-22T09:41:55Z","abstract_excerpt":"Comparing the ranking of candidates by different voters is an important topic in social and information science with a high relevance from the point of view of practical applications. In general, ties and pairs of incomparable candidates may occur, thus, the alternative rankings are described by partial orders. Various distance measures between partial orders have already been introduced, where zero distance is corresponding to a perfect match between a pair of partial orders, and larger values signal greater differences. Here we take a different approach and propose a similarity measure based"},"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":"1601.05922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-01-22T09:41:55Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"fac092025c473ad4e185b187f382240f01c4453c3035e145ffd78cac6a013f5a","abstract_canon_sha256":"414d89885c709657caa88d48718110935c8990accfc9a198302b926a3c7bdee9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.771950Z","signature_b64":"0hxKq+P1+OElLUHhYnDdc1GM91SuGZ+iRH7i28Ll+STTmuW3O3xnzKs2hPiu3VOjID1UaGpvwSfsGP7Sg3BbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5865f2a42eb4edc933f27880a879a03deb4ed60099be1b37d4977dffc3f71f1","last_reissued_at":"2026-05-18T01:22:09.771382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.771382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial order similarity based on mutual information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Gergely Palla, Gergely Tib\\'ely, P\\'eter Pollner","submitted_at":"2016-01-22T09:41:55Z","abstract_excerpt":"Comparing the ranking of candidates by different voters is an important topic in social and information science with a high relevance from the point of view of practical applications. In general, ties and pairs of incomparable candidates may occur, thus, the alternative rankings are described by partial orders. Various distance measures between partial orders have already been introduced, where zero distance is corresponding to a perfect match between a pair of partial orders, and larger values signal greater differences. Here we take a different approach and propose a similarity measure based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05922","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":""},"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":"1601.05922","created_at":"2026-05-18T01:22:09.771453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05922v1","created_at":"2026-05-18T01:22:09.771453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05922","created_at":"2026-05-18T01:22:09.771453+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WDF6KSC5NHN","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WDF6KSC5NHNZEZ7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WDF6KSC","created_at":"2026-05-18T12:30:04.600751+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/6WDF6KSC5NHNZEZ7E6EAVB42AP","json":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP.json","graph_json":"https://pith.science/api/pith-number/6WDF6KSC5NHNZEZ7E6EAVB42AP/graph.json","events_json":"https://pith.science/api/pith-number/6WDF6KSC5NHNZEZ7E6EAVB42AP/events.json","paper":"https://pith.science/paper/6WDF6KSC"},"agent_actions":{"view_html":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP","download_json":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP.json","view_paper":"https://pith.science/paper/6WDF6KSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05922&json=true","fetch_graph":"https://pith.science/api/pith-number/6WDF6KSC5NHNZEZ7E6EAVB42AP/graph.json","fetch_events":"https://pith.science/api/pith-number/6WDF6KSC5NHNZEZ7E6EAVB42AP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP/action/storage_attestation","attest_author":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP/action/author_attestation","sign_citation":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP/action/citation_signature","submit_replication":"https://pith.science/pith/6WDF6KSC5NHNZEZ7E6EAVB42AP/action/replication_record"}},"created_at":"2026-05-18T01:22:09.771453+00:00","updated_at":"2026-05-18T01:22:09.771453+00:00"}