{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QP66XSXOFJKM55QCF6CQKXNKL3","short_pith_number":"pith:QP66XSXO","schema_version":"1.0","canonical_sha256":"83fdebcaee2a54cef6022f85055daa5ee596f508c2b9b79930226bf3b522a012","source":{"kind":"arxiv","id":"1607.02064","version":1},"attestation_state":"computed","paper":{"title":"A note on stable recollements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CT","authors_text":"Clark Barwick, Saul Glasman","submitted_at":"2016-07-07T16:05:01Z","abstract_excerpt":"In this short \\'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed from minimal data: that of a reflective and coreflective full subcategory. The situation has more symmetry than one would expect at a glance. We end with a practical lemma on gluing equivalences along a recollement."},"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":"1607.02064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2016-07-07T16:05:01Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"6d1f751654b65b744aadb58445e185c8a04911ee8abfbcbc5827b2dc9d327aa0","abstract_canon_sha256":"4e263a3925b9931d756aebfa39d9526b8793efacc16d705d6a489dc7d7dbea76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:22.264886Z","signature_b64":"IROiHoSyU0HvyN8u9eSPyVHHdiGAaFHe4fAw4z8W8yg+M3wsgMYi7kH1XT6Q2eUcXxERMeJ0cHBVFBOwabc2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83fdebcaee2a54cef6022f85055daa5ee596f508c2b9b79930226bf3b522a012","last_reissued_at":"2026-05-18T01:11:22.264369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:22.264369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on stable recollements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CT","authors_text":"Clark Barwick, Saul Glasman","submitted_at":"2016-07-07T16:05:01Z","abstract_excerpt":"In this short \\'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed from minimal data: that of a reflective and coreflective full subcategory. The situation has more symmetry than one would expect at a glance. We end with a practical lemma on gluing equivalences along a recollement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02064","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":""},"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":"1607.02064","created_at":"2026-05-18T01:11:22.264462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02064v1","created_at":"2026-05-18T01:11:22.264462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02064","created_at":"2026-05-18T01:11:22.264462+00:00"},{"alias_kind":"pith_short_12","alias_value":"QP66XSXOFJKM","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QP66XSXOFJKM55QC","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QP66XSXO","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.02904","citing_title":"An Introduction to Higher Categorical Algebra","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2110.06567","citing_title":"Recollements and stratification","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3","json":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3.json","graph_json":"https://pith.science/api/pith-number/QP66XSXOFJKM55QCF6CQKXNKL3/graph.json","events_json":"https://pith.science/api/pith-number/QP66XSXOFJKM55QCF6CQKXNKL3/events.json","paper":"https://pith.science/paper/QP66XSXO"},"agent_actions":{"view_html":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3","download_json":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3.json","view_paper":"https://pith.science/paper/QP66XSXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02064&json=true","fetch_graph":"https://pith.science/api/pith-number/QP66XSXOFJKM55QCF6CQKXNKL3/graph.json","fetch_events":"https://pith.science/api/pith-number/QP66XSXOFJKM55QCF6CQKXNKL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3/action/storage_attestation","attest_author":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3/action/author_attestation","sign_citation":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3/action/citation_signature","submit_replication":"https://pith.science/pith/QP66XSXOFJKM55QCF6CQKXNKL3/action/replication_record"}},"created_at":"2026-05-18T01:11:22.264462+00:00","updated_at":"2026-05-18T01:11:22.264462+00:00"}