{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W2HNQU3MXEAKO7ITJCIPJW3HKS","short_pith_number":"pith:W2HNQU3M","canonical_record":{"source":{"id":"1406.2867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-11T12:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"9f89b8b69922ecc7c84b1a06c300903289f1976a5f8a47029f16a407e778f026","abstract_canon_sha256":"967fc61c005fd2ba5af5e6099793424886ffda16f3c97a74012e3760bae96ee0"},"schema_version":"1.0"},"canonical_sha256":"b68ed8536cb900a77d134890f4db6754b908b579d3c401ee75cb0c987d57419a","source":{"kind":"arxiv","id":"1406.2867","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2867","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2867v2","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2867","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"W2HNQU3MXEAK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W2HNQU3MXEAKO7IT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W2HNQU3M","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W2HNQU3MXEAKO7ITJCIPJW3HKS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-11T12:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"9f89b8b69922ecc7c84b1a06c300903289f1976a5f8a47029f16a407e778f026","abstract_canon_sha256":"967fc61c005fd2ba5af5e6099793424886ffda16f3c97a74012e3760bae96ee0"},"schema_version":"1.0"},"canonical_sha256":"b68ed8536cb900a77d134890f4db6754b908b579d3c401ee75cb0c987d57419a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:18.707741Z","signature_b64":"vGqD9k3KJXHCedsVC4B7egRljlMcuCrbn+16MkHqFr7GESdrUdG+fsDmBaoZVtRPEcXkKlCiaH8lOHweMEyUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b68ed8536cb900a77d134890f4db6754b908b579d3c401ee75cb0c987d57419a","last_reissued_at":"2026-05-18T02:43:18.707176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:18.707176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2867","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIeGPikEePcBzgGigXWuJaSiiRl+VJW/v66iQe57VyzgPlQPMNiBcaGvUM8Vg1+PeiEEx8MJhKrJZp2HdplKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:32:48.469502Z"},"content_sha256":"4201a6f50cf2f1e008ce673a22c0864c336541795aaae26b18facfee505896c5","schema_version":"1.0","event_id":"sha256:4201a6f50cf2f1e008ce673a22c0864c336541795aaae26b18facfee505896c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W2HNQU3MXEAKO7ITJCIPJW3HKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formation of a giant component in the intersection graph of a random chord diagram","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, Huseyin Acan","submitted_at":"2014-06-11T12:02:57Z","abstract_excerpt":"We study the number of chords and the number of crossings in the largest component of a random chord diagram when the chords are sparsely crossing. This is equivalent to studying the number of vertices and the number of edges in the largest component of the random intersection graph. Denoting the number of chords by n and the number of crossings by m, when m/nlog(n) tends to a limit in (0,2/\\pi^2), we show that the chord diagram chosen uniformly at random from all the diagrams with given parameters has a component containing almost all the crossings and a positive fraction of chords. On the ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2867","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/owJwVEOFzRmxo+VX/mpU8VhoAiU6RgJSHQyZTmYHWBqVgahXVgUXAGjrDZvRhV7xshlftRb9co1unoSqpaaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:32:48.469863Z"},"content_sha256":"14a9c7a503811504d37e1c87fe10c0b295ef69dbb0b029e1f1d5d909b7e3041b","schema_version":"1.0","event_id":"sha256:14a9c7a503811504d37e1c87fe10c0b295ef69dbb0b029e1f1d5d909b7e3041b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/bundle.json","state_url":"https://pith.science/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T08:32:48Z","links":{"resolver":"https://pith.science/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS","bundle":"https://pith.science/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/bundle.json","state":"https://pith.science/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2HNQU3MXEAKO7ITJCIPJW3HKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W2HNQU3MXEAKO7ITJCIPJW3HKS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"967fc61c005fd2ba5af5e6099793424886ffda16f3c97a74012e3760bae96ee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-11T12:02:57Z","title_canon_sha256":"9f89b8b69922ecc7c84b1a06c300903289f1976a5f8a47029f16a407e778f026"},"schema_version":"1.0","source":{"id":"1406.2867","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2867","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2867v2","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2867","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"W2HNQU3MXEAK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W2HNQU3MXEAKO7IT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W2HNQU3M","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:14a9c7a503811504d37e1c87fe10c0b295ef69dbb0b029e1f1d5d909b7e3041b","target":"graph","created_at":"2026-05-18T02:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the number of chords and the number of crossings in the largest component of a random chord diagram when the chords are sparsely crossing. This is equivalent to studying the number of vertices and the number of edges in the largest component of the random intersection graph. Denoting the number of chords by n and the number of crossings by m, when m/nlog(n) tends to a limit in (0,2/\\pi^2), we show that the chord diagram chosen uniformly at random from all the diagrams with given parameters has a component containing almost all the crossings and a positive fraction of chords. On the ot","authors_text":"Boris Pittel, Huseyin Acan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-11T12:02:57Z","title":"Formation of a giant component in the intersection graph of a random chord diagram"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2867","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4201a6f50cf2f1e008ce673a22c0864c336541795aaae26b18facfee505896c5","target":"record","created_at":"2026-05-18T02:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"967fc61c005fd2ba5af5e6099793424886ffda16f3c97a74012e3760bae96ee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-11T12:02:57Z","title_canon_sha256":"9f89b8b69922ecc7c84b1a06c300903289f1976a5f8a47029f16a407e778f026"},"schema_version":"1.0","source":{"id":"1406.2867","kind":"arxiv","version":2}},"canonical_sha256":"b68ed8536cb900a77d134890f4db6754b908b579d3c401ee75cb0c987d57419a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b68ed8536cb900a77d134890f4db6754b908b579d3c401ee75cb0c987d57419a","first_computed_at":"2026-05-18T02:43:18.707176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:18.707176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGqD9k3KJXHCedsVC4B7egRljlMcuCrbn+16MkHqFr7GESdrUdG+fsDmBaoZVtRPEcXkKlCiaH8lOHweMEyUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:18.707741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2867","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4201a6f50cf2f1e008ce673a22c0864c336541795aaae26b18facfee505896c5","sha256:14a9c7a503811504d37e1c87fe10c0b295ef69dbb0b029e1f1d5d909b7e3041b"],"state_sha256":"e90231a30a7f255d41148e3f8513770e2dc53352c34801b45f21baa3baf689e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1wbQDCUylvXvknTx1CS9xts8SA+d7YwIcegV3iU/GrjQlkwMNiOCxdQpU4JnndE9RrNUzROU+LWF7dy+aFtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:32:48.472455Z","bundle_sha256":"e8ddda5f3cc4b0f188bc3c5d6b29592c68a4dd766bce9ff94f7fedb0410280bb"}}