{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AJ7K2AQPSPESZ3IWDWO6RIIMBS","short_pith_number":"pith:AJ7K2AQP","canonical_record":{"source":{"id":"2501.07943","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2025-01-14T08:55:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"046eb61a97550bea18feddc95ef6852e0ebc8bae47cca74231598ad670882fa9","abstract_canon_sha256":"eddc1de2d2b4618f786a1dcb73fe8c0c6a8f3d79311059de8b04b6f92e959028"},"schema_version":"1.0"},"canonical_sha256":"027ead020f93c92ced161d9de8a10c0cb00c1aefdadc0db13146e3ce1625af20","source":{"kind":"arxiv","id":"2501.07943","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07943","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07943v2","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07943","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7K2AQPSPES","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7K2AQPSPESZ3IW","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7K2AQP","created_at":"2026-05-21T01:04:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AJ7K2AQPSPESZ3IWDWO6RIIMBS","target":"record","payload":{"canonical_record":{"source":{"id":"2501.07943","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2025-01-14T08:55:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"046eb61a97550bea18feddc95ef6852e0ebc8bae47cca74231598ad670882fa9","abstract_canon_sha256":"eddc1de2d2b4618f786a1dcb73fe8c0c6a8f3d79311059de8b04b6f92e959028"},"schema_version":"1.0"},"canonical_sha256":"027ead020f93c92ced161d9de8a10c0cb00c1aefdadc0db13146e3ce1625af20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:12.584859Z","signature_b64":"gIG7jAYBMq0Tz93dPHXVHxgP6XA34QU6BIRmVWH8sK5rFc0gp4ai+96h3hbCQ5C/D4JZCIIbpvOspOsNak3nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"027ead020f93c92ced161d9de8a10c0cb00c1aefdadc0db13146e3ce1625af20","last_reissued_at":"2026-05-21T01:04:12.583986Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:12.583986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.07943","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-21T01:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuNXjIUemS7npuAiF9z7vjYHP/OmgCxcO+Ap0sVqQZuP2rgx5jrEJJFVKsWWO2SW4jrA5jP/wTEZLy71qtfqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:17.057289Z"},"content_sha256":"a1155bb43cf3143758341efa2ab1016554f8c0b09f7b4e9c8183e6cfb74498af","schema_version":"1.0","event_id":"sha256:a1155bb43cf3143758341efa2ab1016554f8c0b09f7b4e9c8183e6cfb74498af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AJ7K2AQPSPESZ3IWDWO6RIIMBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization algorithms for Carleson and sparse collections of sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CA","authors_text":"Eline A. Honig, Emiel Lorist","submitted_at":"2025-01-14T08:55:23Z","abstract_excerpt":"Carleson and sparse collections of sets play a central role in dyadic harmonic analysis. We employ methods from optimization theory to study such collections. First, we present a strongly polynomial algorithm to compute the Carleson constant of a collection of sets, improving on the recent approximation algorithm of Rey. Our algorithm is based on submodular function minimization. Second, we provide an algorithm showing that any Carleson collection is sparse, achieving optimal dependence of the respective constants and thus providing a constructive proof of a result of H\\\"anninen. Our key insig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07943","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.07943/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-05-21T01:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vL1htm66bdQVrOXf5Mup3OqaQhT4xNCE/veDAN0a+z50rPXyhntDOAA7euINwo7xJNMHLLmG9VYiLhOSdYWEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:17.057663Z"},"content_sha256":"ddef333983b3b1a0120ed59132e6c1f5f11cba87d47f5eb27ee1b6b2ce9b1671","schema_version":"1.0","event_id":"sha256:ddef333983b3b1a0120ed59132e6c1f5f11cba87d47f5eb27ee1b6b2ce9b1671"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/bundle.json","state_url":"https://pith.science/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/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-10T21:49:17Z","links":{"resolver":"https://pith.science/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS","bundle":"https://pith.science/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/bundle.json","state":"https://pith.science/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJ7K2AQPSPESZ3IWDWO6RIIMBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AJ7K2AQPSPESZ3IWDWO6RIIMBS","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":"eddc1de2d2b4618f786a1dcb73fe8c0c6a8f3d79311059de8b04b6f92e959028","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2025-01-14T08:55:23Z","title_canon_sha256":"046eb61a97550bea18feddc95ef6852e0ebc8bae47cca74231598ad670882fa9"},"schema_version":"1.0","source":{"id":"2501.07943","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07943","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07943v2","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07943","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7K2AQPSPES","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7K2AQPSPESZ3IW","created_at":"2026-05-21T01:04:12Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7K2AQP","created_at":"2026-05-21T01:04:12Z"}],"graph_snapshots":[{"event_id":"sha256:ddef333983b3b1a0120ed59132e6c1f5f11cba87d47f5eb27ee1b6b2ce9b1671","target":"graph","created_at":"2026-05-21T01:04:12Z","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/2501.07943/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Carleson and sparse collections of sets play a central role in dyadic harmonic analysis. We employ methods from optimization theory to study such collections. First, we present a strongly polynomial algorithm to compute the Carleson constant of a collection of sets, improving on the recent approximation algorithm of Rey. Our algorithm is based on submodular function minimization. Second, we provide an algorithm showing that any Carleson collection is sparse, achieving optimal dependence of the respective constants and thus providing a constructive proof of a result of H\\\"anninen. Our key insig","authors_text":"Eline A. Honig, Emiel Lorist","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2025-01-14T08:55:23Z","title":"Optimization algorithms for Carleson and sparse collections of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07943","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:a1155bb43cf3143758341efa2ab1016554f8c0b09f7b4e9c8183e6cfb74498af","target":"record","created_at":"2026-05-21T01:04:12Z","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":"eddc1de2d2b4618f786a1dcb73fe8c0c6a8f3d79311059de8b04b6f92e959028","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2025-01-14T08:55:23Z","title_canon_sha256":"046eb61a97550bea18feddc95ef6852e0ebc8bae47cca74231598ad670882fa9"},"schema_version":"1.0","source":{"id":"2501.07943","kind":"arxiv","version":2}},"canonical_sha256":"027ead020f93c92ced161d9de8a10c0cb00c1aefdadc0db13146e3ce1625af20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"027ead020f93c92ced161d9de8a10c0cb00c1aefdadc0db13146e3ce1625af20","first_computed_at":"2026-05-21T01:04:12.583986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:12.583986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gIG7jAYBMq0Tz93dPHXVHxgP6XA34QU6BIRmVWH8sK5rFc0gp4ai+96h3hbCQ5C/D4JZCIIbpvOspOsNak3nCw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:12.584859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07943","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1155bb43cf3143758341efa2ab1016554f8c0b09f7b4e9c8183e6cfb74498af","sha256:ddef333983b3b1a0120ed59132e6c1f5f11cba87d47f5eb27ee1b6b2ce9b1671"],"state_sha256":"9a1a1a393a40ed79c5fc80941c84bb0bcde7a4b7303e1f7e1638b0ae2e7aa4b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBPUXKswn206/x0ubd9le7lz0XiyJmjdLc6Ek7XvK56uBnEjann+XOBtTBVxHdGCO25ijW6P2FT849+3RsP7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:49:17.059685Z","bundle_sha256":"9886beb7490a6181619494ddd4090298fabd8a4364f0c90ecf35b133a864bee0"}}