{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UUZMKDVWB7AETU4EIODBPGRWYE","short_pith_number":"pith:UUZMKDVW","schema_version":"1.0","canonical_sha256":"a532c50eb60fc049d3844386179a36c10f353b4df18c7dbbbc9b5169670031af","source":{"kind":"arxiv","id":"1006.2767","version":3},"attestation_state":"computed","paper":{"title":"Computing the bounded subcomplex of an unbounded polyhedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc E. Pfetsch, Michael Joswig, Sven Herrmann","submitted_at":"2010-06-14T16:54:34Z","abstract_excerpt":"We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results."},"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":"1006.2767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T16:54:34Z","cross_cats_sorted":[],"title_canon_sha256":"666e47298751a87eb5834b805824d83ce2f578a3aef20a0573bc0505a6ceea28","abstract_canon_sha256":"41c3cb6786d795bada83a642fa76527765a1f76967613453572585f5ad62b08c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:48.129601Z","signature_b64":"MeyoxAkBobTtFhpuEURIRFIYmsZ39ysVM0t8OCSEAJ6ePjch+W0p3c1u2Mf78DuUH1LFqsr23ajbWKCj44WwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a532c50eb60fc049d3844386179a36c10f353b4df18c7dbbbc9b5169670031af","last_reissued_at":"2026-05-18T02:30:48.129128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:48.129128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the bounded subcomplex of an unbounded polyhedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc E. Pfetsch, Michael Joswig, Sven Herrmann","submitted_at":"2010-06-14T16:54:34Z","abstract_excerpt":"We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2767","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":""},"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":"1006.2767","created_at":"2026-05-18T02:30:48.129191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.2767v3","created_at":"2026-05-18T02:30:48.129191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2767","created_at":"2026-05-18T02:30:48.129191+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUZMKDVWB7AE","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUZMKDVWB7AETU4E","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUZMKDVW","created_at":"2026-05-18T12:26:15.391820+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/UUZMKDVWB7AETU4EIODBPGRWYE","json":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE.json","graph_json":"https://pith.science/api/pith-number/UUZMKDVWB7AETU4EIODBPGRWYE/graph.json","events_json":"https://pith.science/api/pith-number/UUZMKDVWB7AETU4EIODBPGRWYE/events.json","paper":"https://pith.science/paper/UUZMKDVW"},"agent_actions":{"view_html":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE","download_json":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE.json","view_paper":"https://pith.science/paper/UUZMKDVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.2767&json=true","fetch_graph":"https://pith.science/api/pith-number/UUZMKDVWB7AETU4EIODBPGRWYE/graph.json","fetch_events":"https://pith.science/api/pith-number/UUZMKDVWB7AETU4EIODBPGRWYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE/action/storage_attestation","attest_author":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE/action/author_attestation","sign_citation":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE/action/citation_signature","submit_replication":"https://pith.science/pith/UUZMKDVWB7AETU4EIODBPGRWYE/action/replication_record"}},"created_at":"2026-05-18T02:30:48.129191+00:00","updated_at":"2026-05-18T02:30:48.129191+00:00"}