{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CAQMJHWN5IIR5Y7BERWXQP3TLS","short_pith_number":"pith:CAQMJHWN","schema_version":"1.0","canonical_sha256":"1020c49ecdea111ee3e1246d783f735cb3243579e1ce7c05cb3f2114b86652e1","source":{"kind":"arxiv","id":"1908.05345","version":1},"attestation_state":"computed","paper":{"title":"On Strict (Outer-)Confluent Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Fabian Klute, Henry F\\\"orster, Martin N\\\"ollenburg, Robert Ganian","submitted_at":"2019-08-14T20:57:59Z","abstract_excerpt":"A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs. If all vertices of the graph lie in the outer face of the drawing, the drawing is called a strict outerconfluent (SOC) drawing. SC and SOC graphs were first considered by Eppstein et al. in Graph Drawing 2013. Here, we establish several new relationships between the class of SC graphs and other graph classes, in particular string graphs and unit-inter"},"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":"1908.05345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-14T20:57:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3f15ef9397d6ea584f1d7394f277fdae3fd84e2c29dbc5c7e4b65e2f5a39516a","abstract_canon_sha256":"c32a6e3fb633ea71067c5f2e9c0e878a32b021e7d24d151e6df393174d333df9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:50.621574Z","signature_b64":"zQ3TIvZ+jw5xf2H4zuCEcD6v9EJuid6GVJ4S3eYOQWEWOSTgDvSSaL7kb8sHyUgNi3AdUTekIqqnFKJ/ghskBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1020c49ecdea111ee3e1246d783f735cb3243579e1ce7c05cb3f2114b86652e1","last_reissued_at":"2026-07-04T23:56:50.621193Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:50.621193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Strict (Outer-)Confluent Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Fabian Klute, Henry F\\\"orster, Martin N\\\"ollenburg, Robert Ganian","submitted_at":"2019-08-14T20:57:59Z","abstract_excerpt":"A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs. If all vertices of the graph lie in the outer face of the drawing, the drawing is called a strict outerconfluent (SOC) drawing. SC and SOC graphs were first considered by Eppstein et al. in Graph Drawing 2013. Here, we establish several new relationships between the class of SC graphs and other graph classes, in particular string graphs and unit-inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05345","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05345/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05345","created_at":"2026-07-04T23:56:50.621252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05345v1","created_at":"2026-07-04T23:56:50.621252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05345","created_at":"2026-07-04T23:56:50.621252+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAQMJHWN5IIR","created_at":"2026-07-04T23:56:50.621252+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAQMJHWN5IIR5Y7B","created_at":"2026-07-04T23:56:50.621252+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAQMJHWN","created_at":"2026-07-04T23:56:50.621252+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/CAQMJHWN5IIR5Y7BERWXQP3TLS","json":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS.json","graph_json":"https://pith.science/api/pith-number/CAQMJHWN5IIR5Y7BERWXQP3TLS/graph.json","events_json":"https://pith.science/api/pith-number/CAQMJHWN5IIR5Y7BERWXQP3TLS/events.json","paper":"https://pith.science/paper/CAQMJHWN"},"agent_actions":{"view_html":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS","download_json":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS.json","view_paper":"https://pith.science/paper/CAQMJHWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05345&json=true","fetch_graph":"https://pith.science/api/pith-number/CAQMJHWN5IIR5Y7BERWXQP3TLS/graph.json","fetch_events":"https://pith.science/api/pith-number/CAQMJHWN5IIR5Y7BERWXQP3TLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS/action/storage_attestation","attest_author":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS/action/author_attestation","sign_citation":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS/action/citation_signature","submit_replication":"https://pith.science/pith/CAQMJHWN5IIR5Y7BERWXQP3TLS/action/replication_record"}},"created_at":"2026-07-04T23:56:50.621252+00:00","updated_at":"2026-07-04T23:56:50.621252+00:00"}