{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H4BQCWMH6BPTHUWDI2BYBMZDP5","short_pith_number":"pith:H4BQCWMH","schema_version":"1.0","canonical_sha256":"3f03015987f05f33d2c3468380b3237f60220e8a02ad233645320b39ed1406a1","source":{"kind":"arxiv","id":"1611.02216","version":1},"attestation_state":"computed","paper":{"title":"Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mart\\'in D. Safe","submitted_at":"2016-11-07T19:07:59Z","abstract_excerpt":"A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J Discrete Math, 13:179--193, 2000]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices fo"},"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":"1611.02216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T19:07:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b91e3301124fb37d5652b28b1c64735091642570923c7e1472ce5cf6480b08f8","abstract_canon_sha256":"23f9541449193e0e2b2e5f6a313dd4c948f0c4a025716affc157689da5ed7e34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:02.835635Z","signature_b64":"rMS0dKQ71W2vfp3uHyuasTZXO7UMTlbfJJcdHqBZxw1FP7zp7LE+UpqRyWzhFJeTbYhQV2ChHkO3pMNlPg7uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f03015987f05f33d2c3468380b3237f60220e8a02ad233645320b39ed1406a1","last_reissued_at":"2026-05-18T01:00:02.835102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:02.835102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mart\\'in D. Safe","submitted_at":"2016-11-07T19:07:59Z","abstract_excerpt":"A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J Discrete Math, 13:179--193, 2000]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02216","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":"1611.02216","created_at":"2026-05-18T01:00:02.835197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02216v1","created_at":"2026-05-18T01:00:02.835197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02216","created_at":"2026-05-18T01:00:02.835197+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4BQCWMH6BPT","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4BQCWMH6BPTHUWD","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4BQCWMH","created_at":"2026-05-18T12:30:19.053100+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/H4BQCWMH6BPTHUWDI2BYBMZDP5","json":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5.json","graph_json":"https://pith.science/api/pith-number/H4BQCWMH6BPTHUWDI2BYBMZDP5/graph.json","events_json":"https://pith.science/api/pith-number/H4BQCWMH6BPTHUWDI2BYBMZDP5/events.json","paper":"https://pith.science/paper/H4BQCWMH"},"agent_actions":{"view_html":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5","download_json":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5.json","view_paper":"https://pith.science/paper/H4BQCWMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02216&json=true","fetch_graph":"https://pith.science/api/pith-number/H4BQCWMH6BPTHUWDI2BYBMZDP5/graph.json","fetch_events":"https://pith.science/api/pith-number/H4BQCWMH6BPTHUWDI2BYBMZDP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5/action/storage_attestation","attest_author":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5/action/author_attestation","sign_citation":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5/action/citation_signature","submit_replication":"https://pith.science/pith/H4BQCWMH6BPTHUWDI2BYBMZDP5/action/replication_record"}},"created_at":"2026-05-18T01:00:02.835197+00:00","updated_at":"2026-05-18T01:00:02.835197+00:00"}