{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XQR6S46XBUZUANVZKFGVENNYCD","short_pith_number":"pith:XQR6S46X","canonical_record":{"source":{"id":"1907.03129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T14:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"f68ab1c5feb8cc82976afdee0d0fdc885a7425de68cebf2a40b304e8efe64acf","abstract_canon_sha256":"30146c47cc7af108037c6d6a26289edeaa327545d3ba9ed66d18471e1f9ec8ca"},"schema_version":"1.0"},"canonical_sha256":"bc23e973d70d334036b9514d5235b810dcada299142a041f12d488ad97922296","source":{"kind":"arxiv","id":"1907.03129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03129","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03129v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03129","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"XQR6S46XBUZU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XQR6S46XBUZUANVZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XQR6S46X","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XQR6S46XBUZUANVZKFGVENNYCD","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T14:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"f68ab1c5feb8cc82976afdee0d0fdc885a7425de68cebf2a40b304e8efe64acf","abstract_canon_sha256":"30146c47cc7af108037c6d6a26289edeaa327545d3ba9ed66d18471e1f9ec8ca"},"schema_version":"1.0"},"canonical_sha256":"bc23e973d70d334036b9514d5235b810dcada299142a041f12d488ad97922296","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.859029Z","signature_b64":"bmBBzFPPulRZYLYYk3Lp5RT/aaKlQibo9slUEpfipDGcKeY0Y8SuCefEGAET7kTxbhZCojz1rsXVLxYFyuEdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc23e973d70d334036b9514d5235b810dcada299142a041f12d488ad97922296","last_reissued_at":"2026-05-17T23:41:18.858311Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.858311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03129","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQpLz7cth0yNdSk0ET7IpprLg5Hav94a/9cDr5x317CY700CMC+SZDJcH8Y43U24+uhCg7uzANwslkhEjwyGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:42:01.623719Z"},"content_sha256":"8d26ba1504982863a7dd39d443ec595ab97437da1e35883aa6a973dfc6b69019","schema_version":"1.0","event_id":"sha256:8d26ba1504982863a7dd39d443ec595ab97437da1e35883aa6a973dfc6b69019"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XQR6S46XBUZUANVZKFGVENNYCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hyung-Chan An, Kangsan Kim, Yongho Shin","submitted_at":"2019-07-06T14:20:06Z","abstract_excerpt":"Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting typical structures within the optimization problems of practical interest, little is known on how the problem behaves in conjunction with parity constraints. This shortfall of understanding was rather disturbing when we consider the central role of parity in the field of combinatorics. In this paper, we present the first constant-factor approximation algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03129","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYZL3I8DpWJgo+xESncG3+7UGGdkIipmS740X85ipbiWb+3f2B20MDSHj+pOdzkHE2kRQGGkYe6EBvZ+yehGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:42:01.624469Z"},"content_sha256":"b8ea81f2548da384000b042659184a06eac551645f562fdd11f95ccc3ed2b852","schema_version":"1.0","event_id":"sha256:b8ea81f2548da384000b042659184a06eac551645f562fdd11f95ccc3ed2b852"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQR6S46XBUZUANVZKFGVENNYCD/bundle.json","state_url":"https://pith.science/pith/XQR6S46XBUZUANVZKFGVENNYCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQR6S46XBUZUANVZKFGVENNYCD/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-05-29T16:42:01Z","links":{"resolver":"https://pith.science/pith/XQR6S46XBUZUANVZKFGVENNYCD","bundle":"https://pith.science/pith/XQR6S46XBUZUANVZKFGVENNYCD/bundle.json","state":"https://pith.science/pith/XQR6S46XBUZUANVZKFGVENNYCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQR6S46XBUZUANVZKFGVENNYCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XQR6S46XBUZUANVZKFGVENNYCD","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":"30146c47cc7af108037c6d6a26289edeaa327545d3ba9ed66d18471e1f9ec8ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T14:20:06Z","title_canon_sha256":"f68ab1c5feb8cc82976afdee0d0fdc885a7425de68cebf2a40b304e8efe64acf"},"schema_version":"1.0","source":{"id":"1907.03129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03129","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03129v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03129","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"XQR6S46XBUZU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XQR6S46XBUZUANVZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XQR6S46X","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:b8ea81f2548da384000b042659184a06eac551645f562fdd11f95ccc3ed2b852","target":"graph","created_at":"2026-05-17T23:41:18Z","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":"Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting typical structures within the optimization problems of practical interest, little is known on how the problem behaves in conjunction with parity constraints. This shortfall of understanding was rather disturbing when we consider the central role of parity in the field of combinatorics. In this paper, we present the first constant-factor approximation algorith","authors_text":"Hyung-Chan An, Kangsan Kim, Yongho Shin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T14:20:06Z","title":"Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03129","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:8d26ba1504982863a7dd39d443ec595ab97437da1e35883aa6a973dfc6b69019","target":"record","created_at":"2026-05-17T23:41:18Z","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":"30146c47cc7af108037c6d6a26289edeaa327545d3ba9ed66d18471e1f9ec8ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T14:20:06Z","title_canon_sha256":"f68ab1c5feb8cc82976afdee0d0fdc885a7425de68cebf2a40b304e8efe64acf"},"schema_version":"1.0","source":{"id":"1907.03129","kind":"arxiv","version":1}},"canonical_sha256":"bc23e973d70d334036b9514d5235b810dcada299142a041f12d488ad97922296","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc23e973d70d334036b9514d5235b810dcada299142a041f12d488ad97922296","first_computed_at":"2026-05-17T23:41:18.858311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.858311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmBBzFPPulRZYLYYk3Lp5RT/aaKlQibo9slUEpfipDGcKeY0Y8SuCefEGAET7kTxbhZCojz1rsXVLxYFyuEdDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.859029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d26ba1504982863a7dd39d443ec595ab97437da1e35883aa6a973dfc6b69019","sha256:b8ea81f2548da384000b042659184a06eac551645f562fdd11f95ccc3ed2b852"],"state_sha256":"8a69059f82cf85a100a30131f70d24daa84b4400d8b7143736b880e82cd20694"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zU3AcRq9Vei5taU0sB569KEu0dLSwfvIEepeM7E8QBJIVgpcZdWhx2S/4Gc6oOGN1Ug7H0SsEMv2zGnwTRRRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:42:01.628364Z","bundle_sha256":"958019eaa0a6b14b96b693b5306a6a04bf3a7b578b162086fb6b49ca94a4f768"}}