{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SJKXNAZQIA6TMJQXXS2F4JVMNI","short_pith_number":"pith:SJKXNAZQ","canonical_record":{"source":{"id":"1703.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-24T14:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"8b56318dfb7a8df9b89a07b372b05f67d8b901acde3d646319a1dbc75c51484f","abstract_canon_sha256":"07b3e23752c5b1d6f45979fce97a033f865b00e3469966d3ab7724aa07d42622"},"schema_version":"1.0"},"canonical_sha256":"9255768330403d362617bcb45e26ac6a295b521ade73a61675b9594826bd2d40","source":{"kind":"arxiv","id":"1703.08433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08433","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08433v1","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08433","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"SJKXNAZQIA6T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJKXNAZQIA6TMJQX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJKXNAZQ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SJKXNAZQIA6TMJQXXS2F4JVMNI","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-24T14:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"8b56318dfb7a8df9b89a07b372b05f67d8b901acde3d646319a1dbc75c51484f","abstract_canon_sha256":"07b3e23752c5b1d6f45979fce97a033f865b00e3469966d3ab7724aa07d42622"},"schema_version":"1.0"},"canonical_sha256":"9255768330403d362617bcb45e26ac6a295b521ade73a61675b9594826bd2d40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.947344Z","signature_b64":"Csa//dGDM89J1WGwPcroAkcUc25lp+2V7yChBoWEE6l9BsSK0lkuPGqv5vVPTDV143mvymUNtH03pb8XIV9dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9255768330403d362617bcb45e26ac6a295b521ade73a61675b9594826bd2d40","last_reissued_at":"2026-05-18T00:47:59.946926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.946926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08433","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-05-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfSxVS1yWr63UETEoRD/ojy6kOiVUl7whRaSlE/hDXAGKEX5PlzT4u7q/6TRvmzlkv+FY5PPf8p5iQKPX8BiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:19.170628Z"},"content_sha256":"29bc81b81bb1311dc41f056975fd40a02bd0dcf43b8263691273d5d3c7d194cc","schema_version":"1.0","event_id":"sha256:29bc81b81bb1311dc41f056975fd40a02bd0dcf43b8263691273d5d3c7d194cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SJKXNAZQIA6TMJQXXS2F4JVMNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric random matchings with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Lueh Chang","submitted_at":"2017-03-24T14:44:04Z","abstract_excerpt":"Let $(\\{1,2,\\ldots,n\\},d)$ be a metric space. We analyze the expected value and the variance of $\\sum_{i=1}^{\\lfloor n/2\\rfloor}\\,d({\\boldsymbol{\\pi}}(2i-1),{\\boldsymbol{\\pi}}(2i))$ for a uniformly random permutation ${\\boldsymbol{\\pi}}$ of $\\{1,2,\\ldots,n\\}$, leading to the following results: (I) Consider the problem of finding a point in $\\{1,2,\\ldots,n\\}$ with the minimum sum of distances to all points. We show that this problem has a randomized algorithm that (1) always outputs a $(2+\\epsilon)$-approximate solution in expected $O(n/\\epsilon^2)$ time and that (2) inherits Indyk's~\\cite{Ind9"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08433","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"},"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-05-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f83DoS6DqzaC9EX4KIi7NkjLDonbREL/0RbWDU9JpHRORN6Dc9Ki0PBGN7k+1jBC3GMZjSKGpns7MgJ+yUQhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:19.170968Z"},"content_sha256":"da96edb36641595815f2980fe0fdfcd8f8bd0b2ea94543e21560e38132d738e6","schema_version":"1.0","event_id":"sha256:da96edb36641595815f2980fe0fdfcd8f8bd0b2ea94543e21560e38132d738e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/bundle.json","state_url":"https://pith.science/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/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-03T19:50:19Z","links":{"resolver":"https://pith.science/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI","bundle":"https://pith.science/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/bundle.json","state":"https://pith.science/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJKXNAZQIA6TMJQXXS2F4JVMNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SJKXNAZQIA6TMJQXXS2F4JVMNI","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":"07b3e23752c5b1d6f45979fce97a033f865b00e3469966d3ab7724aa07d42622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-24T14:44:04Z","title_canon_sha256":"8b56318dfb7a8df9b89a07b372b05f67d8b901acde3d646319a1dbc75c51484f"},"schema_version":"1.0","source":{"id":"1703.08433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08433","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08433v1","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08433","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"SJKXNAZQIA6T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJKXNAZQIA6TMJQX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJKXNAZQ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:da96edb36641595815f2980fe0fdfcd8f8bd0b2ea94543e21560e38132d738e6","target":"graph","created_at":"2026-05-18T00:47:59Z","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"},"paper":{"abstract_excerpt":"Let $(\\{1,2,\\ldots,n\\},d)$ be a metric space. We analyze the expected value and the variance of $\\sum_{i=1}^{\\lfloor n/2\\rfloor}\\,d({\\boldsymbol{\\pi}}(2i-1),{\\boldsymbol{\\pi}}(2i))$ for a uniformly random permutation ${\\boldsymbol{\\pi}}$ of $\\{1,2,\\ldots,n\\}$, leading to the following results: (I) Consider the problem of finding a point in $\\{1,2,\\ldots,n\\}$ with the minimum sum of distances to all points. We show that this problem has a randomized algorithm that (1) always outputs a $(2+\\epsilon)$-approximate solution in expected $O(n/\\epsilon^2)$ time and that (2) inherits Indyk's~\\cite{Ind9","authors_text":"Ching-Lueh Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-24T14:44:04Z","title":"Metric random matchings with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08433","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:29bc81b81bb1311dc41f056975fd40a02bd0dcf43b8263691273d5d3c7d194cc","target":"record","created_at":"2026-05-18T00:47:59Z","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":"07b3e23752c5b1d6f45979fce97a033f865b00e3469966d3ab7724aa07d42622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-24T14:44:04Z","title_canon_sha256":"8b56318dfb7a8df9b89a07b372b05f67d8b901acde3d646319a1dbc75c51484f"},"schema_version":"1.0","source":{"id":"1703.08433","kind":"arxiv","version":1}},"canonical_sha256":"9255768330403d362617bcb45e26ac6a295b521ade73a61675b9594826bd2d40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9255768330403d362617bcb45e26ac6a295b521ade73a61675b9594826bd2d40","first_computed_at":"2026-05-18T00:47:59.946926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:59.946926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Csa//dGDM89J1WGwPcroAkcUc25lp+2V7yChBoWEE6l9BsSK0lkuPGqv5vVPTDV143mvymUNtH03pb8XIV9dAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:59.947344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29bc81b81bb1311dc41f056975fd40a02bd0dcf43b8263691273d5d3c7d194cc","sha256:da96edb36641595815f2980fe0fdfcd8f8bd0b2ea94543e21560e38132d738e6"],"state_sha256":"2674a496ef47d88c0322f0dab124756a4fe1b020b6176d3bcb4429aaaeb77cfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9XOP6xYbLE9vHxwQu1X997gxVTx4WD6apa7qmkQn+RRCktJeXywRhmo+r9KGOrqItY7vPYg6AivUsfgo8DjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:50:19.172801Z","bundle_sha256":"93fa2093025e00ee91efd37aaf4a9e08fde3d42b1babbcfc52696adb3b7e1708"}}