{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QDLW4NH4Q7NDPBZ7XXYJNRN2IO","short_pith_number":"pith:QDLW4NH4","schema_version":"1.0","canonical_sha256":"80d76e34fc87da37873fbdf096c5ba438ed0f91db7f47b8f2f6dc0ca35cf9990","source":{"kind":"arxiv","id":"1501.01489","version":1},"attestation_state":"computed","paper":{"title":"On a uniformly random chord diagram and its intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huseyin Acan","submitted_at":"2015-01-07T13:36:44Z","abstract_excerpt":"A chord diagram refers to a set of chords with distinct endpoints on a circle. The intersection graph of a chord diagram $\\cal C$ is defined by substituting the chords of $\\cal C$ with vertices and by adding edges between two vertices whenever the corresponding two chords cross each other. Let $C_n$ and $G_n$ denote the chord diagram chosen uniformly at random from all chord diagrams with $n$ chords and the corresponding intersection graph, respectively. We analyze $C_n$ and $G_n$ as $n$ tends to infinity. In particular, we study the degree of a random vertex in $G_n$, the $k$-core of $G_n$, a"},"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":"1501.01489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-07T13:36:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9c55f596dd6ca8623ae72aafa77c7213339ac867bb59789e1143a4f31a06aecc","abstract_canon_sha256":"dd0898756a2beaf8ae48929215a78d4bb684238c2865aa6b51257ccdd4625dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.019018Z","signature_b64":"BZOKz+syZGpHKYyvN+dIaV4GYO2XWUV+r106y3RCZXo+FHCljMkh2VTgBaBvTmvVQ/GPhRb7IEmnqo3YnRvnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d76e34fc87da37873fbdf096c5ba438ed0f91db7f47b8f2f6dc0ca35cf9990","last_reissued_at":"2026-05-18T02:29:54.018518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.018518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a uniformly random chord diagram and its intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huseyin Acan","submitted_at":"2015-01-07T13:36:44Z","abstract_excerpt":"A chord diagram refers to a set of chords with distinct endpoints on a circle. The intersection graph of a chord diagram $\\cal C$ is defined by substituting the chords of $\\cal C$ with vertices and by adding edges between two vertices whenever the corresponding two chords cross each other. Let $C_n$ and $G_n$ denote the chord diagram chosen uniformly at random from all chord diagrams with $n$ chords and the corresponding intersection graph, respectively. We analyze $C_n$ and $G_n$ as $n$ tends to infinity. In particular, we study the degree of a random vertex in $G_n$, the $k$-core of $G_n$, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01489","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":"1501.01489","created_at":"2026-05-18T02:29:54.018609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01489v1","created_at":"2026-05-18T02:29:54.018609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01489","created_at":"2026-05-18T02:29:54.018609+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDLW4NH4Q7ND","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDLW4NH4Q7NDPBZ7","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDLW4NH4","created_at":"2026-05-18T12:29:37.295048+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/QDLW4NH4Q7NDPBZ7XXYJNRN2IO","json":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO.json","graph_json":"https://pith.science/api/pith-number/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/graph.json","events_json":"https://pith.science/api/pith-number/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/events.json","paper":"https://pith.science/paper/QDLW4NH4"},"agent_actions":{"view_html":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO","download_json":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO.json","view_paper":"https://pith.science/paper/QDLW4NH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01489&json=true","fetch_graph":"https://pith.science/api/pith-number/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/graph.json","fetch_events":"https://pith.science/api/pith-number/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/action/storage_attestation","attest_author":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/action/author_attestation","sign_citation":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/action/citation_signature","submit_replication":"https://pith.science/pith/QDLW4NH4Q7NDPBZ7XXYJNRN2IO/action/replication_record"}},"created_at":"2026-05-18T02:29:54.018609+00:00","updated_at":"2026-05-18T02:29:54.018609+00:00"}