{"id":"ce8f47af-5058-465c-b3f9-00098dfbba9a","arxiv_id":"2606.24531","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Absolute-offset design enables unified position-invariant random access through entropy and match compression layers with one coordinate and bit-perfect verification.","lead":"The paper shows that absolute-offset coordinates in a compression format called ACEAPEX allow random access through both an entropy layer and a match layer using a single coordinate, with a bit-perfect proof for isolated block decoding. A generalist might read it for potential improvements in fast data retrieval from compressed storage on hardware like GPUs.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Absolute offsets leave cross-block match dependencies unaddressed for true isolated decoding","rationale":"The reader's weakest_assumption is identical to the load-bearing point identified. The abstract explicitly flags the empty-buffer trap and claims a proof, so the design is aware of the issue; the security of the unified-seek claim therefore reduces exactly to whether that proof eliminates cross-block data dependencies. Because the full manuscript is now referenced, the appropriate adjustment is CONDITIONAL pending inspection of the proof details rather than outright UNVERDICTED.","tokens_in":1781,"tokens_out":363,"duration_ms":44105,"concrete_test":"Locate the three-phase verification section; extract the exact rule the encoder follows when selecting matches and the precise state of the output buffer at the start of each block decode. If the rule permits any absolute offset < block start and no auxiliary buffer-filling step is defined, isolated decoding fails for such blocks.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that absolute-offset resolution at encode time plus per-block entropy produces no residual inter-block dependencies, enabling bit-perfect isolated decode of an arbitrary block from one coordinate. However, an absolute back-reference in block B to a position in block A still requires the decompressed bytes at that position to exist in the output buffer when the match is executed. Starting with an empty buffer for B (the empty-buffer trap) means either (a) the encoder must be restricted to intra-block matches only, or (b) external data must be supplied. The abstract asserts a three-phase verification closes the trap but supplies no information on which of these holds or how compression is preserved under the restriction. This makes the \"no residual dependencies\" assumption the least secure link in the argument.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript presents ACEAPEX, a compression scheme using absolute-offset coordinates in the match layer combined with per-block entropy coding. It claims this enables unified position-invariant random access through both layers via a single coordinate, yielding bit-perfect isolated decoding of an arbitrary block. The claim is supported by a three-phase verification asserted to close the empty-buffer trap, with reported seek time of 0.334 ms for a 16 KB block and potential for up to 25,344 independent parsers on one H100; the work explicitly disclaims being a disk-archive format or claiming three-layer generalization.","tokens_in":1915,"tokens_out":319,"duration_ms":19285,"significance":"If the verification is sound, the result would provide a concrete mechanism for dependency-free random access across two compression layers, enabling hardware parallelism that sequential LZ77-style methods cannot achieve. The explicit statement of scope limitations and the availability of code plus verification harness in the repository are positive contributions to reproducibility.","major_comments":[{"comment":"Abstract (three-phase verification paragraph): the central claim that absolute-offset resolution at encode time plus per-block entropy produces no residual inter-block dependencies (enabling isolated decode from one coordinate) rests on the unexamined assertion that the verification closes the empty-buffer trap; the manuscript supplies no concrete description of whether the encoder is restricted to intra-block matches only or how cross-block absolute references are resolved without supplying external decompressed data.","section":"Abstract"}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful review and for highlighting the need for greater clarity in the abstract. We address the single major comment below.","responses":[{"response":"We agree that the abstract does not supply a concrete description of the encoder's match policy or the resolution of potential cross-block references. The manuscript's core design resolves every back-reference to an absolute coordinate at encode time and applies entropy coding independently per block; the three-phase verification is asserted to confirm that this produces no residual dependencies, allowing isolated bit-perfect decoding from a single coordinate. However, the abstract does not explicitly state the encoder restriction or the verification steps that close the empty-buffer trap. We will revise the abstract (and add a short clarifying paragraph in the main text) to state that the encoder is restricted to intra-block matches only, thereby eliminating any requirement for external decompressed data, and to outline the three verification phases at a high level. This change will be incorporated in the revised manuscript.","revision_made":"yes","referee_comment":"[Abstract] Abstract (three-phase verification paragraph): the central claim that absolute-offset resolution at encode time plus per-block entropy produces no residual inter-block dependencies (enabling isolated decode from one coordinate) rests on the unexamined assertion that the verification closes the empty-buffer trap; the manuscript supplies no concrete description of whether the encoder is restricted to intra-block matches only or how cross-block absolute references are resolved without supplying external decompressed data."}],"tokens_in":1351,"tokens_out":318,"duration_ms":14450,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main contribution is a format where absolute-offset back-references at encode time plus per-block entropy coding let you pick any block by one coordinate and decode it through both layers bit-perfect and alone. The authors state they know of no earlier format that does unified seek across the two layers this way. They back the claim with a three-phase verification that closes the empty-buffer trap, run end-to-end checks on four data profiles, and give a 0.334 ms seek time for a 16 KB block. They also note the structure can unroll to 25,344 independent parsers on an H100. The repository contains the code and harness.\n\nThe work is narrow but concrete. The explicit list of what is not claimed (not a disk-archive format, throughput is match-phase only, three-layer case left open) keeps expectations realistic. Credit the reproducible elements: the verification harness and the hardware scaling numbers are checkable.\n\nThe soft spot is the handling of cross-block references. Absolute offsets remove the need to know relative distances, but a match that lands in another block still needs the decompressed bytes from that block to be in the output buffer. The paper says the three-phase verification resolves the empty-buffer trap, yet the details of whether matches are restricted to intra-block or how external context is supplied without breaking isolation would need direct inspection. If the verification only works under heavy restrictions, the compression benefit shrinks.\n\nThis is for engineers who build storage or database systems that need fast random access inside multi-layer compressed data. A reader already working on dictionary-plus-entropy formats would get practical value from the coordinate scheme and the numbers.\n\nThe paper has a focused claim, a described proof, benchmarks, and shipped code, so it deserves a serious referee rather than a desk reject.","headline":"The paper shows single-coordinate isolated decode through both match and entropy layers via absolute offsets, with a three-phase verification and available code.","tokens_in":2387,"tokens_out":434,"would_cite":false,"duration_ms":18441,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Absolute-offset coordinates let any block decode bit-perfectly through match and entropy layers using one coordinate.","keywords":["random access","compression layers","absolute offsets","match layer","entropy layer","bit-perfect decoding","parallel parsers","device-resident verification"],"falsifier":"A block whose decoding produces a bit mismatch or requires state from another block despite using only the supplied absolute coordinate.","tokens_in":2658,"feed_emoji":"","tokens_out":728,"duration_ms":22703,"temperature":0.7,"pith_summary":"The paper shows that resolving all back-references to absolute positions at encode time in the match layer, while applying entropy coding independently per block, removes the need for context from other blocks. This makes it possible to seek to and decode an arbitrary block through both layers with a single coordinate, producing an exact match to the original data. The claim is supported by a three-phase verification process that handles edge cases such as empty buffers. Practical results include a 0.334 ms seek time for a 16 KB block and the ability to run up to 25,344 independent parsers on one H100. The work is framed as a round-trip correctness proof for two layers rather than a complete storage format.","feed_headline":"One coordinate decodes any block through match and entropy layers","feed_subtitle":"Absolute offsets fix back-references at encode time, enabling isolated bit-perfect seeks across two layers.","key_machinery":"Absolute-offset coordinates that resolve every match-layer back-reference to a fixed position at encode time, combined with per-block entropy coding.","core_discovery":"ACEAPEX's absolute-offset design provides exactly this: because the match layer resolves every back-reference to an absolute position at encode time, and the entropy layer is applied per block, an arbitrary block can be decoded through both layers using one coordinate, bit-perfect, in isolation. We prove this with a three-phase verification that closes the empty-buffer trap. The seek of one 16KB block through ANS-entropy and match completes in 0.334ms. We verify the full entropy+match pipeline end-to-end on four data profiles and characterize the hardware ceiling the format reaches: the absolute-offset structure unrolls to as many as 25,344 independent parsers on one H100, which sequential L","pith_inferences":["The independence of blocks could reduce memory traffic in large-scale parallel decompression systems.","Similar absolute-position techniques might apply to other multi-layer codecs to enable isolated access.","Hardware designs could allocate separate parser units per block to reach the reported parallelism ceiling.","Testing the three-layer hypothesis would require extending the three-phase verification to an additional compression stage."],"forward_implications":["Any single block can be decoded through the full match-plus-entropy pipeline without loading neighboring blocks.","The approach supports up to 25,344 independent parsers on one H100 GPU.","Seek time for a 16 KB block is 0.334 ms through both layers.","The result holds for two compression layers, with three-layer generalization stated as a hypothesis.","The verification is a round-trip correctness proof, not a claim about disk-archive formats or throughput."],"fun_headline_variants":["Absolute offsets support single-coordinate seeks through entropy and match layers","Unified random access through two layers with absolute-offset coordinates","Single coordinate provides bit-perfect dual-layer decoding in isolation","Position-invariant access via absolute offsets across dual compression layers"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The match layer resolves every back-reference to an absolute position at encode time with no residual dependencies between blocks that would require additional context for isolated decoding.","fun_headline_variants_meta":{"raw":{"variants":["Absolute offsets support single-coordinate seeks through entropy and match layers","Unified random access through two layers with absolute-offset coordinates","Single coordinate provides bit-perfect dual-layer decoding in isolation","Position-invariant access via absolute offsets across dual compression layers"]},"model":"grok-4.3","cost_usd":0.006216,"raw_usage":{"total_tokens":2979,"prompt_tokens":770,"num_sources_used":0,"completion_tokens":62,"cost_in_usd_ticks":62162000,"prompt_tokens_details":{"text_tokens":770,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2147,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":770,"tokens_out":62,"duration_ms":15475,"temperature":1.0,"reasoning_tokens":2147,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-25T22:47:49.306073+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A block whose decoding produces a bit mismatch or requires state from another block despite using only the supplied absolute coordinate.","supporting_citations":[],"review_version":1}