{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ENJQBQ5NT5WLIEY4XWAAHK7NL2","short_pith_number":"pith:ENJQBQ5N","canonical_record":{"source":{"id":"1812.09085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-12-21T12:39:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6bec7e0e663614ddb980cc47e0c6ace00438b67b895aea942d0685181ce96f05","abstract_canon_sha256":"01b5628260e18a829d2f0c08e194b27d332b5e85b7195715e3bb4e6803166dc9"},"schema_version":"1.0"},"canonical_sha256":"235300c3ad9f6cb4131cbd8003abed5ea11b79d84ee706104d1cf5f295289ecb","source":{"kind":"arxiv","id":"1812.09085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09085","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09085v2","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09085","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"ENJQBQ5NT5WL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENJQBQ5NT5WLIEY4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENJQBQ5N","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ENJQBQ5NT5WLIEY4XWAAHK7NL2","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-12-21T12:39:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6bec7e0e663614ddb980cc47e0c6ace00438b67b895aea942d0685181ce96f05","abstract_canon_sha256":"01b5628260e18a829d2f0c08e194b27d332b5e85b7195715e3bb4e6803166dc9"},"schema_version":"1.0"},"canonical_sha256":"235300c3ad9f6cb4131cbd8003abed5ea11b79d84ee706104d1cf5f295289ecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:58.007157Z","signature_b64":"UuL/CLnPuLUB+ijA+aIzjFsBzTLb/JSRt2libqeP8BoLv/PtL7AXVu8KV2a/BcQbSy+9igH/Tt2AU+nYSpySDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"235300c3ad9f6cb4131cbd8003abed5ea11b79d84ee706104d1cf5f295289ecb","last_reissued_at":"2026-05-17T23:44:58.006550Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:58.006550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09085","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-17T23:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5U5KKssNxwhxSMYDf6nxlwoAUF7NtvjUBUB8wJZwLmo4aoaaK1p9LrVH4OuobQUHmqb1PRQASZx+tLVmIZyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:32.902244Z"},"content_sha256":"7503f167afd0f7efc4cd23214a6af17ad477fb0536f386594e7b85c02c2f0186","schema_version":"1.0","event_id":"sha256:7503f167afd0f7efc4cd23214a6af17ad477fb0536f386594e7b85c02c2f0186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ENJQBQ5NT5WLIEY4XWAAHK7NL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact computation of the matching distance on 2-parameter persistence modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Michael Kerber, Michael Lesnick, Steve Oudot","submitted_at":"2018-12-21T12:39:24Z","abstract_excerpt":"The matching distance is a pseudometric on multi-parameter persistence modules, defined in terms of the weighted bottleneck distance on the restriction of the modules to affine lines. It is known that this distance is stable in a reasonable sense, and can be efficiently approximated, which makes it a promising tool for practical applications. In this work, we show that in the 2-parameter setting, the matching distance can be computed exactly in polynomial time. Our approach subdivides the space of affine lines into regions, via a line arrangement. In each region, the matching distance restrict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09085","kind":"arxiv","version":2},"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:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3plezIxezPmDhvK3phYp6j3DdmfSIWgEGYz1FV1Ea8YqD4VU5XvtgYeiq//YQi4ywod6Lb+S/TIv7EGDaAGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:32.902907Z"},"content_sha256":"aff38e3734c5147af89c8fd0ba7c2fda2cdc36b0fd5fbac3cb25972c5d406894","schema_version":"1.0","event_id":"sha256:aff38e3734c5147af89c8fd0ba7c2fda2cdc36b0fd5fbac3cb25972c5d406894"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/bundle.json","state_url":"https://pith.science/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/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-27T02:15:32Z","links":{"resolver":"https://pith.science/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2","bundle":"https://pith.science/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/bundle.json","state":"https://pith.science/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENJQBQ5NT5WLIEY4XWAAHK7NL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ENJQBQ5NT5WLIEY4XWAAHK7NL2","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":"01b5628260e18a829d2f0c08e194b27d332b5e85b7195715e3bb4e6803166dc9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-12-21T12:39:24Z","title_canon_sha256":"6bec7e0e663614ddb980cc47e0c6ace00438b67b895aea942d0685181ce96f05"},"schema_version":"1.0","source":{"id":"1812.09085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09085","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09085v2","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09085","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"ENJQBQ5NT5WL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENJQBQ5NT5WLIEY4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENJQBQ5N","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:aff38e3734c5147af89c8fd0ba7c2fda2cdc36b0fd5fbac3cb25972c5d406894","target":"graph","created_at":"2026-05-17T23:44: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The matching distance is a pseudometric on multi-parameter persistence modules, defined in terms of the weighted bottleneck distance on the restriction of the modules to affine lines. It is known that this distance is stable in a reasonable sense, and can be efficiently approximated, which makes it a promising tool for practical applications. In this work, we show that in the 2-parameter setting, the matching distance can be computed exactly in polynomial time. Our approach subdivides the space of affine lines into regions, via a line arrangement. In each region, the matching distance restrict","authors_text":"Michael Kerber, Michael Lesnick, Steve Oudot","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-12-21T12:39:24Z","title":"Exact computation of the matching distance on 2-parameter persistence modules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09085","kind":"arxiv","version":2},"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:7503f167afd0f7efc4cd23214a6af17ad477fb0536f386594e7b85c02c2f0186","target":"record","created_at":"2026-05-17T23:44: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":"01b5628260e18a829d2f0c08e194b27d332b5e85b7195715e3bb4e6803166dc9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-12-21T12:39:24Z","title_canon_sha256":"6bec7e0e663614ddb980cc47e0c6ace00438b67b895aea942d0685181ce96f05"},"schema_version":"1.0","source":{"id":"1812.09085","kind":"arxiv","version":2}},"canonical_sha256":"235300c3ad9f6cb4131cbd8003abed5ea11b79d84ee706104d1cf5f295289ecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"235300c3ad9f6cb4131cbd8003abed5ea11b79d84ee706104d1cf5f295289ecb","first_computed_at":"2026-05-17T23:44:58.006550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:58.006550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuL/CLnPuLUB+ijA+aIzjFsBzTLb/JSRt2libqeP8BoLv/PtL7AXVu8KV2a/BcQbSy+9igH/Tt2AU+nYSpySDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:58.007157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7503f167afd0f7efc4cd23214a6af17ad477fb0536f386594e7b85c02c2f0186","sha256:aff38e3734c5147af89c8fd0ba7c2fda2cdc36b0fd5fbac3cb25972c5d406894"],"state_sha256":"f77dcf0b19ee90feca19c0281d032e7430e7e8b3d5802174f58fc3ae6904f800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFUtTFKvlbsvJBvn5+pIOdkpR30YJrIXGaMzcAgJwBKqn5wwzW4QMusvS5QfHimeg7SdYUJ/PuAUZqtaBHwzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:15:32.906432Z","bundle_sha256":"c826397856390dd697f12175afb94d7d5bde9bedef77029d698e60be1e7a3423"}}