{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E3OBMX6SVWCGWA3ASOM64NANSA","short_pith_number":"pith:E3OBMX6S","schema_version":"1.0","canonical_sha256":"26dc165fd2ad846b03609399ee340d90381c8b16f1de717a66ce54a25a7e0042","source":{"kind":"arxiv","id":"2605.24240","version":1},"attestation_state":"computed","paper":{"title":"A Parameterized Algorithm for Testing whether the Limit of a Diagram is Empty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CT","authors_text":"Benjamin Merlin Bumpus, Daniel Rosiak, Emilio Minichiello, Ernst Althaus, James Fairbanks","submitted_at":"2026-05-22T21:32:24Z","abstract_excerpt":"A limit of a (small) diagram $d : J \\to E$ in a complete category $E$ can be thought of as specifying a set of equations involving the objects of $E$. To motivate this intuitively, one can think of each object $d(j)$ as a \"variable\" and each morphism in $J$ as a \"constraint\" connecting these variables. If $E$ has an initial object, a natural question arises: does our set of equations have any solution at all? Equivalently, we can ask: is the limit of $d$ initial? In this paper we consider the computational problem that, given finite diagram $d$ in a finitely complete category $E$, asks whether"},"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":"2605.24240","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CT","submitted_at":"2026-05-22T21:32:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"474d0c51be31f1496f35b51245d81d2df1b423738a56ab73ecb14e2830f602cb","abstract_canon_sha256":"32bdb79938512496794c823b008afd3752ee7c027d9505c83a3a07d4821dfb90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:54.327177Z","signature_b64":"NntSEswXeh2USCbAOuT3CWxcFyn+twGmJgCxHMLGn0gb2AzjAMUSlkxClj1XMnKNHcRNFBmV9g2t+UsBTKg/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26dc165fd2ad846b03609399ee340d90381c8b16f1de717a66ce54a25a7e0042","last_reissued_at":"2026-05-26T01:02:54.326423Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:54.326423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parameterized Algorithm for Testing whether the Limit of a Diagram is Empty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CT","authors_text":"Benjamin Merlin Bumpus, Daniel Rosiak, Emilio Minichiello, Ernst Althaus, James Fairbanks","submitted_at":"2026-05-22T21:32:24Z","abstract_excerpt":"A limit of a (small) diagram $d : J \\to E$ in a complete category $E$ can be thought of as specifying a set of equations involving the objects of $E$. To motivate this intuitively, one can think of each object $d(j)$ as a \"variable\" and each morphism in $J$ as a \"constraint\" connecting these variables. If $E$ has an initial object, a natural question arises: does our set of equations have any solution at all? Equivalently, we can ask: is the limit of $d$ initial? In this paper we consider the computational problem that, given finite diagram $d$ in a finitely complete category $E$, asks whether"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24240","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24240/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":"2605.24240","created_at":"2026-05-26T01:02:54.326551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24240v1","created_at":"2026-05-26T01:02:54.326551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24240","created_at":"2026-05-26T01:02:54.326551+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3OBMX6SVWCG","created_at":"2026-05-26T01:02:54.326551+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3OBMX6SVWCGWA3A","created_at":"2026-05-26T01:02:54.326551+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3OBMX6S","created_at":"2026-05-26T01:02:54.326551+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/E3OBMX6SVWCGWA3ASOM64NANSA","json":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA.json","graph_json":"https://pith.science/api/pith-number/E3OBMX6SVWCGWA3ASOM64NANSA/graph.json","events_json":"https://pith.science/api/pith-number/E3OBMX6SVWCGWA3ASOM64NANSA/events.json","paper":"https://pith.science/paper/E3OBMX6S"},"agent_actions":{"view_html":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA","download_json":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA.json","view_paper":"https://pith.science/paper/E3OBMX6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24240&json=true","fetch_graph":"https://pith.science/api/pith-number/E3OBMX6SVWCGWA3ASOM64NANSA/graph.json","fetch_events":"https://pith.science/api/pith-number/E3OBMX6SVWCGWA3ASOM64NANSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA/action/storage_attestation","attest_author":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA/action/author_attestation","sign_citation":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA/action/citation_signature","submit_replication":"https://pith.science/pith/E3OBMX6SVWCGWA3ASOM64NANSA/action/replication_record"}},"created_at":"2026-05-26T01:02:54.326551+00:00","updated_at":"2026-05-26T01:02:54.326551+00:00"}