{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SQJLRBSH7TIKZRLKPFGJLBVTPF","short_pith_number":"pith:SQJLRBSH","canonical_record":{"source":{"id":"2308.13252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-25T08:59:03Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"338402477a781e4f4c288e3eae53d8986a95a7d859a1158a6bdffe4cd4d9b799","abstract_canon_sha256":"cbfbcba5894543049877126166c4e68dbb6d237dfb9718f12022ef93cfe48a4d"},"schema_version":"1.0"},"canonical_sha256":"9412b88647fcd0acc56a794c9586b3796fb8c7573faad9e3c011264fa048be03","source":{"kind":"arxiv","id":"2308.13252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13252","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13252v1","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13252","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"SQJLRBSH7TIK","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_16","alias_value":"SQJLRBSH7TIKZRLK","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_8","alias_value":"SQJLRBSH","created_at":"2026-07-05T06:44:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SQJLRBSH7TIKZRLKPFGJLBVTPF","target":"record","payload":{"canonical_record":{"source":{"id":"2308.13252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-25T08:59:03Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"338402477a781e4f4c288e3eae53d8986a95a7d859a1158a6bdffe4cd4d9b799","abstract_canon_sha256":"cbfbcba5894543049877126166c4e68dbb6d237dfb9718f12022ef93cfe48a4d"},"schema_version":"1.0"},"canonical_sha256":"9412b88647fcd0acc56a794c9586b3796fb8c7573faad9e3c011264fa048be03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:41.075136Z","signature_b64":"K0owMxPdU18s1sbPTSZgJTkha6KIzl7NGbzfgdrW920h5+A6eqz9BRwii5XTlCj0CwFvu7bxQo3ca+jaIT4tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9412b88647fcd0acc56a794c9586b3796fb8c7573faad9e3c011264fa048be03","last_reissued_at":"2026-07-05T06:44:41.074701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:41.074701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.13252","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-05T06:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aS4w9E+CoXc6RjxdnXNg6Awz2PpFZh4Zvh9wGNAqZfFD3Gf+VxACx8Ryt6CEThtfkvZ33TAbW5DsHUYfDP5qBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:55:13.613178Z"},"content_sha256":"9b65d8794de8213f828c0ab3b7d921494fa7ba063a3f55461366a1311769242d","schema_version":"1.0","event_id":"sha256:9b65d8794de8213f828c0ab3b7d921494fa7ba063a3f55461366a1311769242d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SQJLRBSH7TIKZRLKPFGJLBVTPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kissing to Find a Match: Efficient Low-Rank Permutation Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Felix Heide, Hannah Dr\\\"oge, Michael M\\\"oller, Onofre Martorell, Yuval Bahat, Zorah L\\\"ahner","submitted_at":"2023-08-25T08:59:03Z","abstract_excerpt":"Permutation matrices play a key role in matching and assignment problems across the fields, especially in computer vision and robotics. However, memory for explicitly representing permutation matrices grows quadratically with the size of the problem, prohibiting large problem instances. In this work, we propose to tackle the curse of dimensionality of large permutation matrices by approximating them using low-rank matrix factorization, followed by a nonlinearity. To this end, we rely on the Kissing number theory to infer the minimal rank required for representing a permutation matrix of a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13252","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/2308.13252/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-05T06:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BIa5x90vnXY3+yAoCxX9Qt1QFH05Mc0U2w7vX9+N/FHq6s91iHY1XyuWpAo6KGxTYYRINZzH11ZxJvPUqzDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:55:13.613578Z"},"content_sha256":"67425d8ebc81f0f9bd9ef241b257c4377f9166664637a0be551a49350916e50f","schema_version":"1.0","event_id":"sha256:67425d8ebc81f0f9bd9ef241b257c4377f9166664637a0be551a49350916e50f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/bundle.json","state_url":"https://pith.science/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/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-07-05T15:55:13Z","links":{"resolver":"https://pith.science/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF","bundle":"https://pith.science/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/bundle.json","state":"https://pith.science/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQJLRBSH7TIKZRLKPFGJLBVTPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SQJLRBSH7TIKZRLKPFGJLBVTPF","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":"cbfbcba5894543049877126166c4e68dbb6d237dfb9718f12022ef93cfe48a4d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-25T08:59:03Z","title_canon_sha256":"338402477a781e4f4c288e3eae53d8986a95a7d859a1158a6bdffe4cd4d9b799"},"schema_version":"1.0","source":{"id":"2308.13252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13252","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13252v1","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13252","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"SQJLRBSH7TIK","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_16","alias_value":"SQJLRBSH7TIKZRLK","created_at":"2026-07-05T06:44:41Z"},{"alias_kind":"pith_short_8","alias_value":"SQJLRBSH","created_at":"2026-07-05T06:44:41Z"}],"graph_snapshots":[{"event_id":"sha256:67425d8ebc81f0f9bd9ef241b257c4377f9166664637a0be551a49350916e50f","target":"graph","created_at":"2026-07-05T06:44:41Z","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/2308.13252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Permutation matrices play a key role in matching and assignment problems across the fields, especially in computer vision and robotics. However, memory for explicitly representing permutation matrices grows quadratically with the size of the problem, prohibiting large problem instances. In this work, we propose to tackle the curse of dimensionality of large permutation matrices by approximating them using low-rank matrix factorization, followed by a nonlinearity. To this end, we rely on the Kissing number theory to infer the minimal rank required for representing a permutation matrix of a give","authors_text":"Felix Heide, Hannah Dr\\\"oge, Michael M\\\"oller, Onofre Martorell, Yuval Bahat, Zorah L\\\"ahner","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-25T08:59:03Z","title":"Kissing to Find a Match: Efficient Low-Rank Permutation Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13252","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:9b65d8794de8213f828c0ab3b7d921494fa7ba063a3f55461366a1311769242d","target":"record","created_at":"2026-07-05T06:44:41Z","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":"cbfbcba5894543049877126166c4e68dbb6d237dfb9718f12022ef93cfe48a4d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-25T08:59:03Z","title_canon_sha256":"338402477a781e4f4c288e3eae53d8986a95a7d859a1158a6bdffe4cd4d9b799"},"schema_version":"1.0","source":{"id":"2308.13252","kind":"arxiv","version":1}},"canonical_sha256":"9412b88647fcd0acc56a794c9586b3796fb8c7573faad9e3c011264fa048be03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9412b88647fcd0acc56a794c9586b3796fb8c7573faad9e3c011264fa048be03","first_computed_at":"2026-07-05T06:44:41.074701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:44:41.074701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0owMxPdU18s1sbPTSZgJTkha6KIzl7NGbzfgdrW920h5+A6eqz9BRwii5XTlCj0CwFvu7bxQo3ca+jaIT4tBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:44:41.075136Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b65d8794de8213f828c0ab3b7d921494fa7ba063a3f55461366a1311769242d","sha256:67425d8ebc81f0f9bd9ef241b257c4377f9166664637a0be551a49350916e50f"],"state_sha256":"8a0e1ea0a239478418dc40cbda1c6ad9a14b1193246a587a3c27eb00ebe796f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEV4QxE3112PuPwMeNxkmXj3P/5Sfb0mVzgpyHIKabijCkFgtksxMzsdWoUw/e4Woya3VtCwY0lV53U/JS35Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:55:13.615893Z","bundle_sha256":"02ac4bcfbf72ff53655bb94a790c9b847e5a8d81c4b5f840b20cb95767cbce5e"}}