{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:27TDOJT2CK6QBAHPN3XXOXBYAP","short_pith_number":"pith:27TDOJT2","schema_version":"1.0","canonical_sha256":"d7e637267a12bd0080ef6eef775c3803ccb5e044ba480523fe8ea4dc16df66f3","source":{"kind":"arxiv","id":"2401.15656","version":5},"attestation_state":"computed","paper":{"title":"Dynamically Allocated Interval-Based Generative Linguistic Steganography with Roulette Wheel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jianyi Liu, Lingxiao Li, Ruiqi Song, Ru Zhang, Yihao Wang","submitted_at":"2024-01-28T13:21:44Z","abstract_excerpt":"Existing linguistic steganography schemes often overlook the conditional probability (CP) of tokens in the candidate pool, allocating the one coding to all tokens, which results in identical selection likelihoods. This approach leads to the selection of low-CP tokens, degrading the quality of stegos and making them more detectable. This paper proposes a scheme based on the interval allocated, called DAIRstega. DAIRstega first uses a portion of the read secret to build the roulette area. Then, this scheme uses the idea of the roulette wheel and takes the CPs of tokens as the main basis for allo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2401.15656","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-01-28T13:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"ecb7367fd21a7933f92ea298b3b4eb9f115dd0f52fd910df66d78031df9d56b0","abstract_canon_sha256":"a46b540d437766747fc7ec2858d56c8ed67ae6162c30a9cee04630da27b1c2b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:33.105690Z","signature_b64":"cBo5OENWi/EE0Iw05uZlHvxyS2fo4D0K5K6luavgoIw7zd5wKy032y1jl4CJGVcAs/gww9tJz1Fdn7t9x+nHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7e637267a12bd0080ef6eef775c3803ccb5e044ba480523fe8ea4dc16df66f3","last_reissued_at":"2026-07-05T10:40:33.105144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:33.105144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamically Allocated Interval-Based Generative Linguistic Steganography with Roulette Wheel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jianyi Liu, Lingxiao Li, Ruiqi Song, Ru Zhang, Yihao Wang","submitted_at":"2024-01-28T13:21:44Z","abstract_excerpt":"Existing linguistic steganography schemes often overlook the conditional probability (CP) of tokens in the candidate pool, allocating the one coding to all tokens, which results in identical selection likelihoods. This approach leads to the selection of low-CP tokens, degrading the quality of stegos and making them more detectable. This paper proposes a scheme based on the interval allocated, called DAIRstega. DAIRstega first uses a portion of the read secret to build the roulette area. Then, this scheme uses the idea of the roulette wheel and takes the CPs of tokens as the main basis for allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15656","kind":"arxiv","version":5},"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/2401.15656/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.15656","created_at":"2026-07-05T10:40:33.105209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15656v5","created_at":"2026-07-05T10:40:33.105209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15656","created_at":"2026-07-05T10:40:33.105209+00:00"},{"alias_kind":"pith_short_12","alias_value":"27TDOJT2CK6Q","created_at":"2026-07-05T10:40:33.105209+00:00"},{"alias_kind":"pith_short_16","alias_value":"27TDOJT2CK6QBAHP","created_at":"2026-07-05T10:40:33.105209+00:00"},{"alias_kind":"pith_short_8","alias_value":"27TDOJT2","created_at":"2026-07-05T10:40:33.105209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08276","citing_title":"ACF: A Collaborative Framework for Agent Covert Communication under Cognitive Asymmetry","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP","json":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP.json","graph_json":"https://pith.science/api/pith-number/27TDOJT2CK6QBAHPN3XXOXBYAP/graph.json","events_json":"https://pith.science/api/pith-number/27TDOJT2CK6QBAHPN3XXOXBYAP/events.json","paper":"https://pith.science/paper/27TDOJT2"},"agent_actions":{"view_html":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP","download_json":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP.json","view_paper":"https://pith.science/paper/27TDOJT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15656&json=true","fetch_graph":"https://pith.science/api/pith-number/27TDOJT2CK6QBAHPN3XXOXBYAP/graph.json","fetch_events":"https://pith.science/api/pith-number/27TDOJT2CK6QBAHPN3XXOXBYAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP/action/storage_attestation","attest_author":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP/action/author_attestation","sign_citation":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP/action/citation_signature","submit_replication":"https://pith.science/pith/27TDOJT2CK6QBAHPN3XXOXBYAP/action/replication_record"}},"created_at":"2026-07-05T10:40:33.105209+00:00","updated_at":"2026-07-05T10:40:33.105209+00:00"}