{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZISAT6AID6BXC5V5LBOOEQ3WWR","short_pith_number":"pith:ZISAT6AI","canonical_record":{"source":{"id":"2510.22186","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-25T06:44:08Z","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.MG"],"title_canon_sha256":"400f1d2225a76cf93b24990ab698cc083bd7ff88d9bc68142aeeaa121d9f2bdc","abstract_canon_sha256":"30c685dbdfbf666dccbebdd19b7f969e609201b73830079d37d7fa6d6d566b32"},"schema_version":"1.0"},"canonical_sha256":"ca2409f8081f837176bd585ce24376b4489d42402d1b0c61af73b1075c576bfd","source":{"kind":"arxiv","id":"2510.22186","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.22186","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2510.22186v2","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.22186","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZISAT6AID6BX","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZISAT6AID6BXC5V5","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZISAT6AI","created_at":"2026-05-26T02:03:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZISAT6AID6BXC5V5LBOOEQ3WWR","target":"record","payload":{"canonical_record":{"source":{"id":"2510.22186","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-25T06:44:08Z","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.MG"],"title_canon_sha256":"400f1d2225a76cf93b24990ab698cc083bd7ff88d9bc68142aeeaa121d9f2bdc","abstract_canon_sha256":"30c685dbdfbf666dccbebdd19b7f969e609201b73830079d37d7fa6d6d566b32"},"schema_version":"1.0"},"canonical_sha256":"ca2409f8081f837176bd585ce24376b4489d42402d1b0c61af73b1075c576bfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:58.614360Z","signature_b64":"VYSYsNNvE+6o/YUovb2vt3m6eMWE5HQPvWlUosbLJ7DNAGQUPZi4GffBCslSHr3zSPVtwF07onWof/ODOrwjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca2409f8081f837176bd585ce24376b4489d42402d1b0c61af73b1075c576bfd","last_reissued_at":"2026-05-26T02:03:58.613415Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:58.613415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.22186","source_version":2,"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-05-26T02:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUzJUx51yFkjnY0Gnp2La9SGlsTL1V9NUFHWtLhCnagQB0VxvtdWBOG8KbXmnmS/Luz7zigU6VPVaPZSwFZJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:11:57.648718Z"},"content_sha256":"99c6991958a0d286534a15f2ffbf64dd1a53d9d8dad8635438bb237bc192bfac","schema_version":"1.0","event_id":"sha256:99c6991958a0d286534a15f2ffbf64dd1a53d9d8dad8635438bb237bc192bfac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZISAT6AID6BXC5V5LBOOEQ3WWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension.","cross_cats":["cs.IT","math.FA","math.IT","math.MG"],"primary_cat":"cs.LG","authors_text":"Daniel Levy, Efstratios Tsoukanis, Matthias Wellershoff, Nadav Dym, Radu Balan","submitted_at":"2025-10-25T06:44:08Z","abstract_excerpt":"We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant to permutations of graph nodes. Previous work showed that for large enough $D$ and projections in general position, this mapping is injective, and moreover satisfies a bi-Lipschitz condition. However, two gaps remain: firstly, the optimal size $D$ required for injectivity is not yet known, and secondly, no estimates of the bi-Lipschitz constants of the mappin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We construct matrices of projection vectors so that the bi-Lipschitz distortion of the mapping depends quadratically on the number of points n, and is completely independent of the dimension d. We also show that for any choice of projection vectors, the distortion of the mapping will never be better than a bound proportional to the square root of n.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes projections are in general position (as stated in prior work) and that point sets lie in Euclidean space where generic linear projections produce distinct values with probability 1; the bi-Lipschitz claims further rely on the specific matrix constructions provided in the paper.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Improved bounds on injectivity dimension D for sorting-based permutation-invariant embeddings of n-point sets, with bi-Lipschitz distortion quadratic in n and independent of ambient dimension d, plus a matching sqrt(n) lower bound on distortion for any choice of projections.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3bd92adad278554e7b49fe8aa91574472d5fc8b12606f703e2241f1bcfbaa773"},"source":{"id":"2510.22186","kind":"arxiv","version":2},"verdict":{"id":"6facbc3b-03ec-428c-9df4-7fa9901d9243","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T04:36:08.602850Z","strongest_claim":"We construct matrices of projection vectors so that the bi-Lipschitz distortion of the mapping depends quadratically on the number of points n, and is completely independent of the dimension d. We also show that for any choice of projection vectors, the distortion of the mapping will never be better than a bound proportional to the square root of n.","one_line_summary":"Improved bounds on injectivity dimension D for sorting-based permutation-invariant embeddings of n-point sets, with bi-Lipschitz distortion quadratic in n and independent of ambient dimension d, plus a matching sqrt(n) lower bound on distortion for any choice of projections.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes projections are in general position (as stated in prior work) and that point sets lie in Euclidean space where generic linear projections produce distinct values with probability 1; the bi-Lipschitz claims further rely on the specific matrix constructions provided in the paper.","pith_extraction_headline":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.22186/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":"6facbc3b-03ec-428c-9df4-7fa9901d9243"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T02:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1eymwE7CI6bi+xKg+Sbw+hHHE4poBI+w4U1NzalXWqjTDZmmDm1E3KOSWwfLdVNJvKM8nzB8C4NhOnfbv+QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:11:57.649834Z"},"content_sha256":"0128cedfdcfab2c6c163c4e5bd354cfa0ec7722827a64de334d93420606d0d9e","schema_version":"1.0","event_id":"sha256:0128cedfdcfab2c6c163c4e5bd354cfa0ec7722827a64de334d93420606d0d9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/bundle.json","state_url":"https://pith.science/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/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-06-05T20:11:57Z","links":{"resolver":"https://pith.science/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR","bundle":"https://pith.science/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/bundle.json","state":"https://pith.science/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZISAT6AID6BXC5V5LBOOEQ3WWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZISAT6AID6BXC5V5LBOOEQ3WWR","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":"30c685dbdfbf666dccbebdd19b7f969e609201b73830079d37d7fa6d6d566b32","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-25T06:44:08Z","title_canon_sha256":"400f1d2225a76cf93b24990ab698cc083bd7ff88d9bc68142aeeaa121d9f2bdc"},"schema_version":"1.0","source":{"id":"2510.22186","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.22186","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2510.22186v2","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.22186","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZISAT6AID6BX","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZISAT6AID6BXC5V5","created_at":"2026-05-26T02:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZISAT6AI","created_at":"2026-05-26T02:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:0128cedfdcfab2c6c163c4e5bd354cfa0ec7722827a64de334d93420606d0d9e","target":"graph","created_at":"2026-05-26T02:03:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We construct matrices of projection vectors so that the bi-Lipschitz distortion of the mapping depends quadratically on the number of points n, and is completely independent of the dimension d. We also show that for any choice of projection vectors, the distortion of the mapping will never be better than a bound proportional to the square root of n."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes projections are in general position (as stated in prior work) and that point sets lie in Euclidean space where generic linear projections produce distinct values with probability 1; the bi-Lipschitz claims further rely on the specific matrix constructions provided in the paper."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Improved bounds on injectivity dimension D for sorting-based permutation-invariant embeddings of n-point sets, with bi-Lipschitz distortion quadratic in n and independent of ambient dimension d, plus a matching sqrt(n) lower bound on distortion for any choice of projections."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension."}],"snapshot_sha256":"3bd92adad278554e7b49fe8aa91574472d5fc8b12606f703e2241f1bcfbaa773"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.22186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant to permutations of graph nodes. Previous work showed that for large enough $D$ and projections in general position, this mapping is injective, and moreover satisfies a bi-Lipschitz condition. However, two gaps remain: firstly, the optimal size $D$ required for injectivity is not yet known, and secondly, no estimates of the bi-Lipschitz constants of the mappin","authors_text":"Daniel Levy, Efstratios Tsoukanis, Matthias Wellershoff, Nadav Dym, Radu Balan","cross_cats":["cs.IT","math.FA","math.IT","math.MG"],"headline":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-25T06:44:08Z","title":"Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.22186","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T04:36:08.602850Z","id":"6facbc3b-03ec-428c-9df4-7fa9901d9243","model_set":{"reader":"grok-4.3"},"one_line_summary":"Improved bounds on injectivity dimension D for sorting-based permutation-invariant embeddings of n-point sets, with bi-Lipschitz distortion quadratic in n and independent of ambient dimension d, plus a matching sqrt(n) lower bound on distortion for any choice of projections.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Sorting-based embeddings of point sets have bi-Lipschitz distortion quadratic in the number of points and independent of dimension.","strongest_claim":"We construct matrices of projection vectors so that the bi-Lipschitz distortion of the mapping depends quadratically on the number of points n, and is completely independent of the dimension d. We also show that for any choice of projection vectors, the distortion of the mapping will never be better than a bound proportional to the square root of n.","weakest_assumption":"The analysis assumes projections are in general position (as stated in prior work) and that point sets lie in Euclidean space where generic linear projections produce distinct values with probability 1; the bi-Lipschitz claims further rely on the specific matrix constructions provided in the paper."}},"verdict_id":"6facbc3b-03ec-428c-9df4-7fa9901d9243"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99c6991958a0d286534a15f2ffbf64dd1a53d9d8dad8635438bb237bc192bfac","target":"record","created_at":"2026-05-26T02:03:58Z","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":"30c685dbdfbf666dccbebdd19b7f969e609201b73830079d37d7fa6d6d566b32","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-25T06:44:08Z","title_canon_sha256":"400f1d2225a76cf93b24990ab698cc083bd7ff88d9bc68142aeeaa121d9f2bdc"},"schema_version":"1.0","source":{"id":"2510.22186","kind":"arxiv","version":2}},"canonical_sha256":"ca2409f8081f837176bd585ce24376b4489d42402d1b0c61af73b1075c576bfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca2409f8081f837176bd585ce24376b4489d42402d1b0c61af73b1075c576bfd","first_computed_at":"2026-05-26T02:03:58.613415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:03:58.613415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYSYsNNvE+6o/YUovb2vt3m6eMWE5HQPvWlUosbLJ7DNAGQUPZi4GffBCslSHr3zSPVtwF07onWof/ODOrwjDQ==","signature_status":"signed_v1","signed_at":"2026-05-26T02:03:58.614360Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.22186","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99c6991958a0d286534a15f2ffbf64dd1a53d9d8dad8635438bb237bc192bfac","sha256:0128cedfdcfab2c6c163c4e5bd354cfa0ec7722827a64de334d93420606d0d9e"],"state_sha256":"fe0bc13ec09c2a21539847bfdbaa868e7bb58446fc3dabd0d242f65094b974d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsLJ/geemgIaea4fwvwTMunvkchXLXV1UDCLSe4K8AYv8PQ3hsZZ5gpUWyn9PDxP9mSM1Oo+neh5XR3No/dgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:11:57.655669Z","bundle_sha256":"ca830b48f54571e0979cfb5ea32301471ff900725b8d2c9e446e1c19abc51a9e"}}