{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OEXGLSUKINCDU7CK3NYTOW2FG7","short_pith_number":"pith:OEXGLSUK","schema_version":"1.0","canonical_sha256":"712e65ca8a43443a7c4adb71375b4537d1717683881c9af810ea772f4c12f424","source":{"kind":"arxiv","id":"1412.1547","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithms to decide tightness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Basudeb Datta, Benjamin A. Burton, Bhaskar Bagchi, Jonathan Spreer, Nitin Singh","submitted_at":"2014-12-04T03:54:03Z","abstract_excerpt":"Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is \"as convex as possible\", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time algorithm, but efficient methods to decide tightness are only known in the trivial setting of triangulated surfaces.\n  In this article, we present a new polynomial time procedure to decide tightness for triangulations of $3$-manifolds -- a problem which previously was thought to be hard. Furthermore, we describe an algorithm to decide general tightness in th"},"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":"1412.1547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T03:54:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7d661a1aa91544b07beb2b79f8ef3fbb66dd4eab365d47bb1ac8966669172586","abstract_canon_sha256":"10218b36c9e921a0f2d2d4ca20f3f1ad5fa5682ba0fba4b09fa9454351a12b54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.899025Z","signature_b64":"XJhON4LPw+G2DdWupiIJf1LoXUuzDR4S0a8NzzlR2CIC0flr/j4C8fMWI+aOV4CAlAvJgKG+lwYu+BAWX+B9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"712e65ca8a43443a7c4adb71375b4537d1717683881c9af810ea772f4c12f424","last_reissued_at":"2026-05-18T00:02:36.898412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.898412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithms to decide tightness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Basudeb Datta, Benjamin A. Burton, Bhaskar Bagchi, Jonathan Spreer, Nitin Singh","submitted_at":"2014-12-04T03:54:03Z","abstract_excerpt":"Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is \"as convex as possible\", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time algorithm, but efficient methods to decide tightness are only known in the trivial setting of triangulated surfaces.\n  In this article, we present a new polynomial time procedure to decide tightness for triangulations of $3$-manifolds -- a problem which previously was thought to be hard. Furthermore, we describe an algorithm to decide general tightness in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1547","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":"1412.1547","created_at":"2026-05-18T00:02:36.898485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1547v1","created_at":"2026-05-18T00:02:36.898485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1547","created_at":"2026-05-18T00:02:36.898485+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEXGLSUKINCD","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEXGLSUKINCDU7CK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEXGLSUK","created_at":"2026-05-18T12:28:41.024544+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/OEXGLSUKINCDU7CK3NYTOW2FG7","json":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7.json","graph_json":"https://pith.science/api/pith-number/OEXGLSUKINCDU7CK3NYTOW2FG7/graph.json","events_json":"https://pith.science/api/pith-number/OEXGLSUKINCDU7CK3NYTOW2FG7/events.json","paper":"https://pith.science/paper/OEXGLSUK"},"agent_actions":{"view_html":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7","download_json":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7.json","view_paper":"https://pith.science/paper/OEXGLSUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1547&json=true","fetch_graph":"https://pith.science/api/pith-number/OEXGLSUKINCDU7CK3NYTOW2FG7/graph.json","fetch_events":"https://pith.science/api/pith-number/OEXGLSUKINCDU7CK3NYTOW2FG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7/action/storage_attestation","attest_author":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7/action/author_attestation","sign_citation":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7/action/citation_signature","submit_replication":"https://pith.science/pith/OEXGLSUKINCDU7CK3NYTOW2FG7/action/replication_record"}},"created_at":"2026-05-18T00:02:36.898485+00:00","updated_at":"2026-05-18T00:02:36.898485+00:00"}