{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:B4L3B5IEIJWLPPY6VYGWPUHU42","short_pith_number":"pith:B4L3B5IE","canonical_record":{"source":{"id":"2208.09454","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-19T17:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"7eecc690515fab4b99833b154ecbc03a672cd3efd11e90a6bfe256fff073db12","abstract_canon_sha256":"c6f7003ebdc68c0acd4ac9aefa77640eb89aefaeaf767311ed77c1cf2272eecd"},"schema_version":"1.0"},"canonical_sha256":"0f17b0f504426cb7bf1eae0d67d0f4e68657f51ce44b681956979381d0b567a9","source":{"kind":"arxiv","id":"2208.09454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.09454","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.09454v1","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.09454","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"B4L3B5IEIJWL","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_16","alias_value":"B4L3B5IEIJWLPPY6","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_8","alias_value":"B4L3B5IE","created_at":"2026-07-05T04:50:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:B4L3B5IEIJWLPPY6VYGWPUHU42","target":"record","payload":{"canonical_record":{"source":{"id":"2208.09454","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-19T17:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"7eecc690515fab4b99833b154ecbc03a672cd3efd11e90a6bfe256fff073db12","abstract_canon_sha256":"c6f7003ebdc68c0acd4ac9aefa77640eb89aefaeaf767311ed77c1cf2272eecd"},"schema_version":"1.0"},"canonical_sha256":"0f17b0f504426cb7bf1eae0d67d0f4e68657f51ce44b681956979381d0b567a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:00.168805Z","signature_b64":"lGVo2ajfvufGAAWJYTBJQS5MVnIGD9t4R+juCTKrYdgIHJzd2BWIBAk4WQh9V+LM3ydBOw3LuFB3MKqrD4/oBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f17b0f504426cb7bf1eae0d67d0f4e68657f51ce44b681956979381d0b567a9","last_reissued_at":"2026-07-05T04:50:00.168343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:00.168343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.09454","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-05T04:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjzM264uQXBU3AiVLFTui7TOJ/tJr2m/SU8/pna0XZdpUSBKxebd7IpQhPc/83u+Lp7MtMw5jM+ckZ7zwJ1gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T03:09:15.459680Z"},"content_sha256":"38bff85f124797c8d31dbbdd6ad2982923edaae2bc918c3251dab26056a0b78d","schema_version":"1.0","event_id":"sha256:38bff85f124797c8d31dbbdd6ad2982923edaae2bc918c3251dab26056a0b78d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:B4L3B5IEIJWLPPY6VYGWPUHU42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Optimization for Unsupervised Extractive Summarization of Long Documents with the Frank-Wolfe Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alicia Y. Tsai, Laurent El Ghaoui","submitted_at":"2022-08-19T17:17:43Z","abstract_excerpt":"We address the problem of unsupervised extractive document summarization, especially for long documents. We model the unsupervised problem as a sparse auto-regression one and approximate the resulting combinatorial problem via a convex, norm-constrained problem. We solve it using a dedicated Frank-Wolfe algorithm. To generate a summary with $k$ sentences, the algorithm only needs to execute $\\approx k$ iterations, making it very efficient. We explain how to avoid explicit calculation of the full gradient and how to include sentence embedding information. We evaluate our approach against two ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.09454","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/2208.09454/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-05T04:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkc93yeBDBLU0j00oPqXrJJVuuqCVDMl1uPsthvbtzQw0JifcM55mVxUoWXXbWZiuxpknTmKQNrEQXWJIPsADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T03:09:15.460330Z"},"content_sha256":"2821e4c6589e779eedd8da285b1903ae27351587efbec518d72daae545260a60","schema_version":"1.0","event_id":"sha256:2821e4c6589e779eedd8da285b1903ae27351587efbec518d72daae545260a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/bundle.json","state_url":"https://pith.science/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/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-08T03:09:15Z","links":{"resolver":"https://pith.science/pith/B4L3B5IEIJWLPPY6VYGWPUHU42","bundle":"https://pith.science/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/bundle.json","state":"https://pith.science/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4L3B5IEIJWLPPY6VYGWPUHU42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B4L3B5IEIJWLPPY6VYGWPUHU42","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":"c6f7003ebdc68c0acd4ac9aefa77640eb89aefaeaf767311ed77c1cf2272eecd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-19T17:17:43Z","title_canon_sha256":"7eecc690515fab4b99833b154ecbc03a672cd3efd11e90a6bfe256fff073db12"},"schema_version":"1.0","source":{"id":"2208.09454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.09454","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.09454v1","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.09454","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"B4L3B5IEIJWL","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_16","alias_value":"B4L3B5IEIJWLPPY6","created_at":"2026-07-05T04:50:00Z"},{"alias_kind":"pith_short_8","alias_value":"B4L3B5IE","created_at":"2026-07-05T04:50:00Z"}],"graph_snapshots":[{"event_id":"sha256:2821e4c6589e779eedd8da285b1903ae27351587efbec518d72daae545260a60","target":"graph","created_at":"2026-07-05T04:50:00Z","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/2208.09454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of unsupervised extractive document summarization, especially for long documents. We model the unsupervised problem as a sparse auto-regression one and approximate the resulting combinatorial problem via a convex, norm-constrained problem. We solve it using a dedicated Frank-Wolfe algorithm. To generate a summary with $k$ sentences, the algorithm only needs to execute $\\approx k$ iterations, making it very efficient. We explain how to avoid explicit calculation of the full gradient and how to include sentence embedding information. We evaluate our approach against two ot","authors_text":"Alicia Y. Tsai, Laurent El Ghaoui","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-19T17:17:43Z","title":"Sparse Optimization for Unsupervised Extractive Summarization of Long Documents with the Frank-Wolfe Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.09454","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:38bff85f124797c8d31dbbdd6ad2982923edaae2bc918c3251dab26056a0b78d","target":"record","created_at":"2026-07-05T04:50:00Z","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":"c6f7003ebdc68c0acd4ac9aefa77640eb89aefaeaf767311ed77c1cf2272eecd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-19T17:17:43Z","title_canon_sha256":"7eecc690515fab4b99833b154ecbc03a672cd3efd11e90a6bfe256fff073db12"},"schema_version":"1.0","source":{"id":"2208.09454","kind":"arxiv","version":1}},"canonical_sha256":"0f17b0f504426cb7bf1eae0d67d0f4e68657f51ce44b681956979381d0b567a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f17b0f504426cb7bf1eae0d67d0f4e68657f51ce44b681956979381d0b567a9","first_computed_at":"2026-07-05T04:50:00.168343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:50:00.168343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGVo2ajfvufGAAWJYTBJQS5MVnIGD9t4R+juCTKrYdgIHJzd2BWIBAk4WQh9V+LM3ydBOw3LuFB3MKqrD4/oBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:50:00.168805Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.09454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38bff85f124797c8d31dbbdd6ad2982923edaae2bc918c3251dab26056a0b78d","sha256:2821e4c6589e779eedd8da285b1903ae27351587efbec518d72daae545260a60"],"state_sha256":"b02919d0867e91c4007f7f5bede046ccca42f2df21f676173051638128c64305"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbIMRqBh5UyX0I+Hv9nczNMQm3cGhlxWUSkFxPeWOJMKp2+R3erq8qQDnJI/MOn25cOeJkqui7seobJ11zZFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T03:09:15.463349Z","bundle_sha256":"024e7806fd08bc66ff4219b70e743c389b146e9228ece520e1aeb2c07e74ba32"}}