{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:H3HRCNLNTPZJEP3YHQAP2RWPC3","short_pith_number":"pith:H3HRCNLN","schema_version":"1.0","canonical_sha256":"3ecf11356d9bf2923f783c00fd46cf16d5bec744b73af0811051804536c07df4","source":{"kind":"arxiv","id":"math/9807049","version":3},"attestation_state":"computed","paper":{"title":"Descente pour les n-champs (Descent for n-stacks)","license":"","headline":"","cross_cats":["math.AT","math.CT"],"primary_cat":"math.AG","authors_text":"Andr\\'e Hirschowitz, Carlos Simpson","submitted_at":"1998-07-09T16:53:42Z","abstract_excerpt":"We develop the theory of n-stacks (or more generally Segal n-stacks which are $\\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main results are: a definition of n-stacks in terms of limits, which should be perfectly general for stacks of any type of objects; several other characterizations of n-stacks in terms of ``effectivity of descent data''; construction of the stack associated to an n-prestack; a strictification result saying that any ``weak'' n-stack is equivalent to a (strict) n-"},"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":"math/9807049","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.AG","submitted_at":"1998-07-09T16:53:42Z","cross_cats_sorted":["math.AT","math.CT"],"title_canon_sha256":"bb445fb10b58ab769ac5fc492fa6c5fc2a423d1b5907deb419273568b771c5c1","abstract_canon_sha256":"5668837eec0c60072dfad1955c9e0ddb096ce45f51db7cee3442ebbe24e28d42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:40:43.476574Z","signature_b64":"kp3t0DsvvGD8X656znPL7f270ZrUbcJNa2NXpzdioLIpINA4MDYMNPE48jm3rMaRvHVKDyTN/3ymtieGjTNcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ecf11356d9bf2923f783c00fd46cf16d5bec744b73af0811051804536c07df4","last_reissued_at":"2026-07-04T14:40:43.476175Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:40:43.476175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Descente pour les n-champs (Descent for n-stacks)","license":"","headline":"","cross_cats":["math.AT","math.CT"],"primary_cat":"math.AG","authors_text":"Andr\\'e Hirschowitz, Carlos Simpson","submitted_at":"1998-07-09T16:53:42Z","abstract_excerpt":"We develop the theory of n-stacks (or more generally Segal n-stacks which are $\\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main results are: a definition of n-stacks in terms of limits, which should be perfectly general for stacks of any type of objects; several other characterizations of n-stacks in terms of ``effectivity of descent data''; construction of the stack associated to an n-prestack; a strictification result saying that any ``weak'' n-stack is equivalent to a (strict) n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9807049","kind":"arxiv","version":3},"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/math/9807049/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":"math/9807049","created_at":"2026-07-04T14:40:43.476235+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9807049v3","created_at":"2026-07-04T14:40:43.476235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9807049","created_at":"2026-07-04T14:40:43.476235+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3HRCNLNTPZJ","created_at":"2026-07-04T14:40:43.476235+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3HRCNLNTPZJEP3Y","created_at":"2026-07-04T14:40:43.476235+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3HRCNLN","created_at":"2026-07-04T14:40:43.476235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3","json":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3.json","graph_json":"https://pith.science/api/pith-number/H3HRCNLNTPZJEP3YHQAP2RWPC3/graph.json","events_json":"https://pith.science/api/pith-number/H3HRCNLNTPZJEP3YHQAP2RWPC3/events.json","paper":"https://pith.science/paper/H3HRCNLN"},"agent_actions":{"view_html":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3","download_json":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3.json","view_paper":"https://pith.science/paper/H3HRCNLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9807049&json=true","fetch_graph":"https://pith.science/api/pith-number/H3HRCNLNTPZJEP3YHQAP2RWPC3/graph.json","fetch_events":"https://pith.science/api/pith-number/H3HRCNLNTPZJEP3YHQAP2RWPC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3/action/storage_attestation","attest_author":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3/action/author_attestation","sign_citation":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3/action/citation_signature","submit_replication":"https://pith.science/pith/H3HRCNLNTPZJEP3YHQAP2RWPC3/action/replication_record"}},"created_at":"2026-07-04T14:40:43.476235+00:00","updated_at":"2026-07-04T14:40:43.476235+00:00"}