{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:62C2BLQMGG6U2QKRAGOB7SRW3F","short_pith_number":"pith:62C2BLQM","schema_version":"1.0","canonical_sha256":"f685a0ae0c31bd4d4151019c1fca36d94ddb54c6f9675b6a6b925c766081b44c","source":{"kind":"arxiv","id":"1312.1172","version":1},"attestation_state":"computed","paper":{"title":"Circular-arc hypergraphs: Rigidity via Connectedness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","submitted_at":"2013-12-04T14:19:07Z","abstract_excerpt":"A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges $A$ and $B$ such that $A$ is a nonempty subset of $B$ and $B$ is not equal to $V(H)$, the corresponding arcs share a common endpoint. We give sufficient conditions for $H$ to have, up to reversing, a unique arc ordering and a unique tight arc ordering. These conditions are stated in terms of connectedness properties of $H$.\n  It is known that $G$ is a proper"},"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":"1312.1172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-04T14:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"32762d4971eb55c4106d32e8cd32a68a19eb5b909bdbfc9e5832e28210cda048","abstract_canon_sha256":"a16840214c7ceca80ebac9eeaf4852f0d84a270d9c71ed31aab578f2db6e1a9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:34.777954Z","signature_b64":"l4hGV3Nih0UvfDrXZwWR1HXZUfCJHb5iv5IZCUvxzjdhT3Ndhp010wk2naWlV7Rr2I0FQG61TReRQqJC2e8TDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f685a0ae0c31bd4d4151019c1fca36d94ddb54c6f9675b6a6b925c766081b44c","last_reissued_at":"2026-05-18T03:05:34.777384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:34.777384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular-arc hypergraphs: Rigidity via Connectedness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","submitted_at":"2013-12-04T14:19:07Z","abstract_excerpt":"A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges $A$ and $B$ such that $A$ is a nonempty subset of $B$ and $B$ is not equal to $V(H)$, the corresponding arcs share a common endpoint. We give sufficient conditions for $H$ to have, up to reversing, a unique arc ordering and a unique tight arc ordering. These conditions are stated in terms of connectedness properties of $H$.\n  It is known that $G$ is a proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1172","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":"1312.1172","created_at":"2026-05-18T03:05:34.777464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1172v1","created_at":"2026-05-18T03:05:34.777464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1172","created_at":"2026-05-18T03:05:34.777464+00:00"},{"alias_kind":"pith_short_12","alias_value":"62C2BLQMGG6U","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"62C2BLQMGG6U2QKR","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"62C2BLQM","created_at":"2026-05-18T12:27:34.582898+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/62C2BLQMGG6U2QKRAGOB7SRW3F","json":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F.json","graph_json":"https://pith.science/api/pith-number/62C2BLQMGG6U2QKRAGOB7SRW3F/graph.json","events_json":"https://pith.science/api/pith-number/62C2BLQMGG6U2QKRAGOB7SRW3F/events.json","paper":"https://pith.science/paper/62C2BLQM"},"agent_actions":{"view_html":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F","download_json":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F.json","view_paper":"https://pith.science/paper/62C2BLQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1172&json=true","fetch_graph":"https://pith.science/api/pith-number/62C2BLQMGG6U2QKRAGOB7SRW3F/graph.json","fetch_events":"https://pith.science/api/pith-number/62C2BLQMGG6U2QKRAGOB7SRW3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F/action/storage_attestation","attest_author":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F/action/author_attestation","sign_citation":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F/action/citation_signature","submit_replication":"https://pith.science/pith/62C2BLQMGG6U2QKRAGOB7SRW3F/action/replication_record"}},"created_at":"2026-05-18T03:05:34.777464+00:00","updated_at":"2026-05-18T03:05:34.777464+00:00"}