{"id":"111e9be2-c179-4cf1-a25e-4ed195a9ab3f","arxiv_id":"2602.17355","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new 'unrolling' construction turns generalized Reedy categories into strict ones, yielding tribe structures on fibrant diagram categories over generalized inverse categories.","lead":"This paper converts a generalized Reedy category with symmetries into an ordinary strict Reedy category, then uses that conversion to put a homotopy-theoretic 'tribe' structure on diagrams built over such categories. A generalist might care because tribes are models of homotopy type theory, and this gives new tools for diagrams over shapes with symmetries, such as cubes with permutations.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Stated finiteness assumptions do not ensure p_* is a finite limit; D_R can have infinitely many objects in one degree, so the right Kan extension may not exist in a general tribe.","rationale":"The reader identified the HV19 adaptation as the weakest assumption. I agree that the transfer through p_* is the load-bearing step, and that Theorem 2.1 is asserted rather than proved for tribes. However, a more concrete blocker appears earlier in Prop 2.2: the claim that p_* is computed as a finite limit is false under the paper's stated finiteness assumptions. The example of a strict direct category with two objects and countably many parallel arrows satisfies the hypotheses yet makes D_R have infinitely many objects of degree 1, so the comma category for the right Kan extension is infinite. Since tribes are not assumed complete, p_* may fail to exist as a functor to T. This is not an internal inconsistency in the adaptation from model categories; it is a missing condition on R or T that the proof does not supply. The theorem might be salvageable by adding local finiteness or by proving the relevant infinite limits exist homotopically, so a conditional acceptance with strengthened hypotheses is appropriate. This does not change the reader's overall CONDITIONAL verdict but identifies a different, more fundamental reason for it.","tokens_in":6141,"tokens_out":19701,"duration_ms":188046,"concrete_test":"Instantiate R with objects a,b of degrees 0 and 1 and countably many parallel arrows f_n:a→b, with R_0=R and c=id. Enumerate the objects of D_R and of the comma category a↓p used to compute p_*X(a). If this category is infinite, the proof's finiteness claim in Prop 2.2 fails, and p_*X(a) would require an infinite limit not guaranteed in an arbitrary tribe. This settles whether the concern lands; if it does, the theorem's hypotheses need strengthening, e.g. requiring Hom_R finite or the relevant slices of D_R finite.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Prop 2.2's proof that p_* exists rests on the assertion that \"P_α is finite since the degree (in D_R) of any of its objects is bounded by n+1... and since there are finitely many objects of each degree.\" The hypotheses on R — finitely many objects per degree and finitely many isomorphisms per degree — do not bound Hom-sets. Let R be the strict direct Reedy category with objects a,b of degrees 0,1 and countably many parallel arrows f_n:a→b, with R_0=R and c=id. This satisfies the stated finiteness conditions. But D_R contains a distinct object f_n:a→b of degree 1 for each n, so D_R has infinitely many objects of degree 1. The comma category used to compute p_*X(a) is therefore infinite. A general tribe is only assumed to have finite limits, so the right Kan extension p_* need not exist. This failure is anterior to the HV19 adaptation: even if Theorem 2.1 is granted, the transfer functor used in Theorem 2.3 may be undefined. The theorem may be repairable by adding a local-finiteness or completeness assumption, but under the stated hypotheses the central construction is not justified.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a transfer method for tribe structures on diagram categories. Starting from a generalized Reedy category R satisfying a lifting condition, it constructs a strict Reedy category D_R and an absolutely dense functor p: D_R → R. For a generalized inverse category R with finiteness assumptions and a tribe T, it defines p-fibrations on T^{R^op}, claims that the right Kan extension p_* endows the fibrant objects T^{R^op}_f with a tribe structure, and illustrates the construction on groups. The central claim is Theorem 2.3.","tokens_in":6496,"tokens_out":5561,"duration_ms":50416,"significance":"If the construction is valid, it would extend the known Reedy tribe structure on strict inverse diagrams to generalized inverse categories with symmetries, and would provide a new tribe of fibrant diagrams for group actions with a concrete fibrancy criterion. The absolutely dense unrolling functor is a useful idea. However, the current proofs leave load-bearing gaps, especially concerning finiteness of the limits used to define p_*.","major_comments":[{"comment":"The proof that p_* exists is not justified. The sentence 'P_α is finite since the degree (in D_R) of any of its objects is bounded by n+1, and since there are finitely many objects of each degree' assumes D_R has finitely many objects of each degree. This does not follow from the hypotheses on R. Let R be the strict direct category with objects a (degree 0) and b (degree 1) and countably many parallel arrows f_n: a→b. R has finitely many objects per degree and no non-identity isomorphisms. Then D_R contains, for each n, the object f_n: a→b→b of degree 1, so D_R has infinitely many objects in degree 1. The comma category computing p_*X(a) is therefore infinite, whereas a tribe is only assumed to have finite limits. Thus p_* need not exist, which invalidates the transfer in Theorem 2.3 as stated. A repair would require a local finiteness assumption on Hom-sets or completeness of T.","section":"Section 2, Proposition 2.2"},{"comment":"This theorem is load-bearing and is stated as 'Adapted from [HV19, Theorem 4.2]' with a one-paragraph proof asserting that the model-category proof carries over to tribes. The cited proof is not reproduced, and the specific hypotheses on the fibering functor G are not checked for the functors used later (e.g. π0 in Proposition 2.2). Since the entire construction of p-fibrations and the morphism of tribes depends on this transfer, the reader cannot verify the central claim. Please provide a complete proof or a precise reference with a verification of all tribe axioms.","section":"Section 2, Theorem 2.1"},{"comment":"The proof that π0 is a cofibering Reedy functor is incomplete. After displaying a factorization, it says 'It is not difficult to complete this diagram in order by a zig-zag...' and then draws a diagram without explaining the maps or the connectivity argument. This is a central step in the proof that p_* is well-defined. The omitted zig-zag must be given explicitly or replaced by a reference.","section":"Section 2, Proposition 2.2"}],"minor_comments":[{"comment":"There is a typo: 'T^{D_op_□s_R}' should presumably be 'T^{D_R^op}'; the subscript '□s' is a stray artifact.","section":"Section 2, Theorem 2.3 proof"},{"comment":"The uniqueness of the factorization is only asserted with 'it is enough to observe that...'. This is plausible but needs a more detailed verification, especially because D_R is defined as a subcategory of a twisted arrow category.","section":"Section 1, Lemma 1.1"},{"comment":"The notation 'F_act_C+(α, σ)' is unusual; consider renaming to 'Fact_C+(α, σ)' for readability.","section":"Section 2, Definition 2.3"},{"comment":"The abstract says 'generalized inverse diagrams' but the paper concerns diagram categories; the terminology should be aligned with the content.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The paper has a promising idea, but the main theorem is not supported as stated due to the finiteness gap in Proposition 2.2 and the under-verified adaptation of HV19. These issues may be repairable by adding finiteness or completeness hypotheses and expanding the proofs, so I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take on arXiv:2602.17355. The unrolling construction D_R is genuinely new, and the strategy of transporting the Reedy tribe structure from strict diagrams to generalized inverse diagrams via an absolutely dense functor is a sensible approach. The examples with cubes with symmetries and with groups are helpful, and the paper is clearly written. If the main theorem holds after repair, this will be a useful tool for HoTT semantics.\n\nThe problem is not just the asserted adaptation of HV19, although that is a real gap. The more serious issue is in the proof of Prop. 2.2. The claim that the comma category P_α is finite rests on the assertion that D_R has finitely many objects in each degree. That does not follow from the stated hypotheses on R. Take the strict direct Reedy category with objects a,b of degrees 0 and 1 and countably many parallel arrows f_n: a -> b. This has finitely many objects per degree and only identity isomorphisms, so it satisfies the paper's conditions. But each f_n gives a distinct object of D_R of degree 1, so D_R has infinitely many objects in degree 1. The comma category computing p_*X(a) is then infinite, and a general tribe only has finite limits. So p_* may not exist at all, and Theorem 2.3 is not established as stated. This failure is anterior to the HV19 adaptation: even granting Theorem 2.1, the transfer functor is undefined.\n\nThe fix is probably to add a local finiteness condition on R — for instance, requiring finite Hom-sets or at least finite fibers in the unrolling — but that is a substantive change to the hypotheses. The paper should also give a full proof of Theorem 2.1 rather than a one-paragraph assertion that the model-category proof carries over. The skipped connectivity argument in Prop. 2.2 is minor by comparison, but it is in the same load-bearing proof.\n\nOn the positive side, the absolutely dense functor is handled honestly, the citation pattern is clean, and the paper does not overclaim. The construction and the intended transfer are worth taking seriously. I would send this to a referee, with the expectation of major revision: the referee should ask for a precise finiteness condition under which p_* exists, a complete proof of the HV19 adaptation, and a reworked Prop. 2.2.","headline":"A genuinely new unrolling construction, but the main theorem's proof has a finiteness gap that can make p_* undefined; needs a sharper hypothesis.","tokens_in":6888,"tokens_out":4567,"would_cite":false,"duration_ms":41040,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["18N40","18A25"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that for any tribe T and any generalized inverse category R with finite degrees and finite symmetries, the category of fibrant diagrams in T^{R^op} is itself a tribe, obtained by unrolling R into a strict Reedy category and","keywords":["generalized inverse category","tribe","absolutely dense functor","Reedy fibration","right Kan extension","unrolling construction","fibrant diagrams","pi-tribe"],"falsifier":"Work through the group example: for G = Z/2 and T the tribe of small categories with isofibrations, compute explicitly whether every morphism between G-objects factors as a pointwise anodyne map followed by a p-fibration. The theorem asserts it must; if a single factorization is missing, the main claim fails. Alternatively, test the Gluing-lemma step used to show p_* preserves anodyne maps on the two-object, two-parallel-arrow category D_G.","tokens_in":6070,"feed_emoji":"🧩","tokens_out":10341,"duration_ms":82911,"temperature":0.7,"pith_summary":"The paper sets out to show that homotopical structure can be lifted from strict Reedy diagrams to diagrams indexed by generalized inverse categories, which may contain non-identity isomorphisms. Its central result, Theorem 2.3, states that for any tribe T, a category with fibrations and anodyne maps similar to a fibration category, and any generalized inverse category R satisfying a finiteness condition, the subcategory of p-fibrant diagrams in T^{R^op} is a tribe. The engine is an 'unrolling' construction that replaces R by a strict Reedy category D_R through an absolutely dense functor p, allowing Reedy fibrations in the strict world to define fibrations on the generalized side. If correct, this provides a uniform tribe structure on diagram categories that previously lacked one, including diagrams over categories with symmetries such as cubical sites and groups. The finiteness condition, finitely many objects and isomorphisms in each degree, ensures the right Kan extension can be computed from finite limits.","feed_headline":"Generalized inverse diagrams get a tribe structure","feed_subtitle":"An absolutely dense unrolling functor transfers Reedy fibrations to any tribe, covering cube and group diagrams.","key_machinery":"The unrolling construction: starting with a generalized Reedy category R and a strict Reedy subcategory R_0 through which every arrow of R lifts up to isomorphism, one forms a free-category pushout and defines D_R as the full subcategory of the twisted arrow category (the category of arrows with factorization maps as morphisms) spanned by arrows that factor as a map from R_0 followed by a free isomorphism. The projection p:D_R->R is absolutely dense, meaning precomposition with p is fully faithful, which allows Reedy fibrations on the strict side to define fibrations on the generalized side. The other load-bearing tool is a theorem, adapted from a model-category result, asserting that precom","core_discovery":"The main theorem constructs a tribe structure on the category of p-fibrant diagrams in T^{R^op}, where T is any tribe and R is a generalized inverse category with finitely many objects and isomorphisms in each degree. Fibrations are defined as maps whose image under the absolutely dense functor p:D_R->R is a Reedy fibration, while the weak equivalences are pointwise anodyne maps. The functor p is produced by the unrolling construction: starting from a strict Reedy subcategory R_0 of R, one forms a free-category pushout and takes D_R as the full subcategory of the twisted arrow category whose objects are arrows factorable as a map from R_0 followed by a free isomorphism. Lemma 1.2 shows p is","pith_inferences":["Not pursued in the paper: the finiteness conditions likely reflect the need to compute the right Kan extension p_* as a finite limit; relaxing them may require replacing finite limits with filtered limits, which would be a natural extension.","Not pursued in the paper: the same unrolling technique might transfer Reedy structure into other settings where model-category theorems are known, such as fibration categories or spectral categories, yielding analogous diagram structures.","Not pursued in the paper: the group example hints at a connection to equivariant homotopy theory; the tribe of fibrant G-objects could be tested as a model for G-equivariant families inside a single tribe."],"forward_implications":["Diagrams over any generalized inverse category satisfying the finiteness hypotheses carry a tribe structure, so factorization and lifting properties exist even when the indexing category has non-trivial isomorphisms.","The construction covers cubical categories with symmetries, yielding a Reedy-like tribe structure for diagrams over symmetric cube sites.","In the group case, p-fibrant objects are exactly those G-objects whose matching maps are fibrations; for the tribe of small categories with isofibrations, this means the diagonal map must be an isofibration, forcing the category to be gaunt.","When T is a pi-tribe, the diagram tribe is again a pi-tribe, so internal products of fibrations exist.","The resulting fibration category differs from the pointwise one, as shown by the group example, so the new structure is a genuinely different homotopical structure rather than the trivial product structure."],"fun_headline_variants":["Unrolling functor gives tribe structure to inverse diagrams","Dense unrolling transfers Reedy structure into any tribe","Tribe structure for p-fibrant diagrams in any tribe","Unrolling gives explicit tribe structure for inverse diagrams"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing premise is that the model-category theorem carrying Reedy fibrations through fibering functors transfers to tribes without any additional verification; the paper sketches rather than fully proves this transfer, so the whole result collapses if that adaptation fails.","fun_headline_variants_meta":{"raw":{"variants":["Unrolling functor gives tribe structure to inverse diagrams","Dense unrolling transfers Reedy structure into any tribe","Tribe structure for p-fibrant diagrams in any tribe","Unrolling gives explicit tribe structure for inverse diagrams"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000465,"raw_usage":{"total_tokens":2078,"prompt_tokens":585,"completion_tokens":1493,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":329,"completion_tokens_details":{"reasoning_tokens":1428}},"tokens_in":329,"tokens_out":1493,"duration_ms":9603,"temperature":1.0,"reasoning_tokens":1428,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T22:14:04.614609+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Work through the group example: for G = Z/2 and T the tribe of small categories with isofibrations, compute explicitly whether every morphism between G-objects factors as a pointwise anodyne map followed by a p-fibration. The theorem asserts it must; if a single factorization is missing, the main claim fails. Alternatively, test the Gluing-lemma step used to show p_* preserves anodyne maps on the two-object, two-parallel-arrow category D_G.","supporting_citations":[],"review_version":1}