{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S5BDMUJZB5ATYIYHQSMIZLOPG2","short_pith_number":"pith:S5BDMUJZ","canonical_record":{"source":{"id":"2502.04535","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T22:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"2bff5c8b81dd12d848c3fb76482c8abf16b93d92aa4174b0db6ee08981517960","abstract_canon_sha256":"352b8d31fbafa30bcc021b4c11d5d3e73c4ae0eb12b3cb6dd8331076defadb7d"},"schema_version":"1.0"},"canonical_sha256":"97423651390f413c230784988cadcf368a2b3e92f53ab21647c8d8b0f7bcbb76","source":{"kind":"arxiv","id":"2502.04535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04535","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04535v1","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04535","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"S5BDMUJZB5AT","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"S5BDMUJZB5ATYIYH","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"S5BDMUJZ","created_at":"2026-07-05T10:10:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S5BDMUJZB5ATYIYHQSMIZLOPG2","target":"record","payload":{"canonical_record":{"source":{"id":"2502.04535","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T22:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"2bff5c8b81dd12d848c3fb76482c8abf16b93d92aa4174b0db6ee08981517960","abstract_canon_sha256":"352b8d31fbafa30bcc021b4c11d5d3e73c4ae0eb12b3cb6dd8331076defadb7d"},"schema_version":"1.0"},"canonical_sha256":"97423651390f413c230784988cadcf368a2b3e92f53ab21647c8d8b0f7bcbb76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:53.046276Z","signature_b64":"odZffdaF9clLbCUhq9jlpdrhLOqJQ2tQdsM+wsGZjQc0CS3bmNoflLjJn+NI0Un7tYaqUVT8VoQ48OVXii0/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97423651390f413c230784988cadcf368a2b3e92f53ab21647c8d8b0f7bcbb76","last_reissued_at":"2026-07-05T10:10:53.045846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:53.045846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.04535","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-05T10:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBe0rlJxcFLgmI2rh+qjx7nTuuKxJ7BtswZV9sHJN03UWN6MBrjHbty0/cbrpAnjypzw0ZU1pSlwFrkZ5W8iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:42:59.483819Z"},"content_sha256":"17e5ac2f8ae5d0a418cb406e9baec14d5a76f7d4f2db169c85cda934b58c7c1b","schema_version":"1.0","event_id":"sha256:17e5ac2f8ae5d0a418cb406e9baec14d5a76f7d4f2db169c85cda934b58c7c1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S5BDMUJZB5ATYIYHQSMIZLOPG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cameron Jen, Chenyang Huang, Hao Zhou, Kangjie Zheng, Lili Mou, Osmar R. Za\\\"iane","submitted_at":"2025-02-06T22:12:55Z","abstract_excerpt":"Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be satisfied. In this study, we propose a novel length-control decoding algorithm based on the Directed Acyclic Transformer (DAT). Our approach allows for multiple plausible sequence fragments and predicts a \\emph{path} to connect them. In addition, we propose a Sequence Maximum a Posteriori (SeqMAP) decoding algorithm that marginalizes different possible path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04535","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/2502.04535/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-05T10:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6C3B/vBABrSkhBpejuv+zLaUkH+xiBQnemHfQPamSansF9J5DL0sLPK2PDkXT8ojLgCq90pQ3MQhDoT5LajLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:42:59.484583Z"},"content_sha256":"a02cf5e6f63b7821848c099cb5a04a7c6cce983b87faa14e217497766ed575f9","schema_version":"1.0","event_id":"sha256:a02cf5e6f63b7821848c099cb5a04a7c6cce983b87faa14e217497766ed575f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/bundle.json","state_url":"https://pith.science/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/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-08-22T02:42:59Z","links":{"resolver":"https://pith.science/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2","bundle":"https://pith.science/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/bundle.json","state":"https://pith.science/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5BDMUJZB5ATYIYHQSMIZLOPG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S5BDMUJZB5ATYIYHQSMIZLOPG2","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":"352b8d31fbafa30bcc021b4c11d5d3e73c4ae0eb12b3cb6dd8331076defadb7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T22:12:55Z","title_canon_sha256":"2bff5c8b81dd12d848c3fb76482c8abf16b93d92aa4174b0db6ee08981517960"},"schema_version":"1.0","source":{"id":"2502.04535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04535","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04535v1","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04535","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"S5BDMUJZB5AT","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"S5BDMUJZB5ATYIYH","created_at":"2026-07-05T10:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"S5BDMUJZ","created_at":"2026-07-05T10:10:53Z"}],"graph_snapshots":[{"event_id":"sha256:a02cf5e6f63b7821848c099cb5a04a7c6cce983b87faa14e217497766ed575f9","target":"graph","created_at":"2026-07-05T10:10:53Z","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/2502.04535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be satisfied. In this study, we propose a novel length-control decoding algorithm based on the Directed Acyclic Transformer (DAT). Our approach allows for multiple plausible sequence fragments and predicts a \\emph{path} to connect them. In addition, we propose a Sequence Maximum a Posteriori (SeqMAP) decoding algorithm that marginalizes different possible path","authors_text":"Cameron Jen, Chenyang Huang, Hao Zhou, Kangjie Zheng, Lili Mou, Osmar R. Za\\\"iane","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T22:12:55Z","title":"A Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04535","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:17e5ac2f8ae5d0a418cb406e9baec14d5a76f7d4f2db169c85cda934b58c7c1b","target":"record","created_at":"2026-07-05T10:10:53Z","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":"352b8d31fbafa30bcc021b4c11d5d3e73c4ae0eb12b3cb6dd8331076defadb7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T22:12:55Z","title_canon_sha256":"2bff5c8b81dd12d848c3fb76482c8abf16b93d92aa4174b0db6ee08981517960"},"schema_version":"1.0","source":{"id":"2502.04535","kind":"arxiv","version":1}},"canonical_sha256":"97423651390f413c230784988cadcf368a2b3e92f53ab21647c8d8b0f7bcbb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97423651390f413c230784988cadcf368a2b3e92f53ab21647c8d8b0f7bcbb76","first_computed_at":"2026-07-05T10:10:53.045846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:53.045846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"odZffdaF9clLbCUhq9jlpdrhLOqJQ2tQdsM+wsGZjQc0CS3bmNoflLjJn+NI0Un7tYaqUVT8VoQ48OVXii0/Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:53.046276Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.04535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17e5ac2f8ae5d0a418cb406e9baec14d5a76f7d4f2db169c85cda934b58c7c1b","sha256:a02cf5e6f63b7821848c099cb5a04a7c6cce983b87faa14e217497766ed575f9"],"state_sha256":"c509c8fd5548ac33a2a762b0a9035cd0fc306d500d5f982c28d6b7acde07ab71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4w6eJP1SBu3O3NHhd7EjOcH9ZcVefa3Q/tHOuBVTXOZ5U1TGO7jbYTyX7agbbOdkw5MNyFldBGdXHQoXPMRICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T02:42:59.490490Z","bundle_sha256":"b6b452e861be3ef52bab0c7dc6aff969beaf62a6009d23a55263e21d32bb7a46"}}