{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FH7XTKK4K7M3RH7S3DEPIIO6GW","short_pith_number":"pith:FH7XTKK4","schema_version":"1.0","canonical_sha256":"29ff79a95c57d9b89ff2d8c8f421de35b1a44abd508a650094b48113940f59f0","source":{"kind":"arxiv","id":"1202.4406","version":5},"attestation_state":"computed","paper":{"title":"Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","submitted_at":"2012-02-20T18:06:08Z","abstract_excerpt":"We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where `canonical' means that models of isomorphic graphs are equal. This implies that the recognition and the isomorphism problems for this class of graphs are solvable in logspace. For a broader class of concave-round graphs, that still possess (not necessarily proper) circular-arc models, we show that those can also be constructed canonically in logspace. As a building block for these results, we show how to compute canonical models of circular-arc hypergraphs in logspace, wh"},"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":"1202.4406","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-20T18:06:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fc287f4c0b145c4c963f3277201bb527bb1c92625f1cdb1bc8350194fa9454a3","abstract_canon_sha256":"bb4673983d1abd16219861931d363b15a26e85d177024bfda21749ff6eba9861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:28.555190Z","signature_b64":"8+6CcwybS0qsXHf4i3OQ0orpRay/GN1GmVGx6jYoifgjC9obCNg/dB6eWtXLKQ+VPjQ8mNqfzYhzrQOsXfNxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29ff79a95c57d9b89ff2d8c8f421de35b1a44abd508a650094b48113940f59f0","last_reissued_at":"2026-05-18T03:05:28.554440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:28.554440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","submitted_at":"2012-02-20T18:06:08Z","abstract_excerpt":"We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where `canonical' means that models of isomorphic graphs are equal. This implies that the recognition and the isomorphism problems for this class of graphs are solvable in logspace. For a broader class of concave-round graphs, that still possess (not necessarily proper) circular-arc models, we show that those can also be constructed canonically in logspace. As a building block for these results, we show how to compute canonical models of circular-arc hypergraphs in logspace, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4406","kind":"arxiv","version":5},"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":"1202.4406","created_at":"2026-05-18T03:05:28.554572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4406v5","created_at":"2026-05-18T03:05:28.554572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4406","created_at":"2026-05-18T03:05:28.554572+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH7XTKK4K7M3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH7XTKK4K7M3RH7S","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH7XTKK4","created_at":"2026-05-18T12:27:06.952714+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/FH7XTKK4K7M3RH7S3DEPIIO6GW","json":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW.json","graph_json":"https://pith.science/api/pith-number/FH7XTKK4K7M3RH7S3DEPIIO6GW/graph.json","events_json":"https://pith.science/api/pith-number/FH7XTKK4K7M3RH7S3DEPIIO6GW/events.json","paper":"https://pith.science/paper/FH7XTKK4"},"agent_actions":{"view_html":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW","download_json":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW.json","view_paper":"https://pith.science/paper/FH7XTKK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4406&json=true","fetch_graph":"https://pith.science/api/pith-number/FH7XTKK4K7M3RH7S3DEPIIO6GW/graph.json","fetch_events":"https://pith.science/api/pith-number/FH7XTKK4K7M3RH7S3DEPIIO6GW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW/action/storage_attestation","attest_author":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW/action/author_attestation","sign_citation":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW/action/citation_signature","submit_replication":"https://pith.science/pith/FH7XTKK4K7M3RH7S3DEPIIO6GW/action/replication_record"}},"created_at":"2026-05-18T03:05:28.554572+00:00","updated_at":"2026-05-18T03:05:28.554572+00:00"}