{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ASW6UDUQHJA5ECQMZ6RUMNVHV6","short_pith_number":"pith:ASW6UDUQ","schema_version":"1.0","canonical_sha256":"04adea0e903a41d20a0ccfa34636a7af96556b9ade509554e40e37ea8b87099f","source":{"kind":"arxiv","id":"0710.4053","version":2},"attestation_state":"computed","paper":{"title":"Crossings and nesting in tangled-diagrams","license":"","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Jing Qin, William Y. C. Chen","submitted_at":"2007-10-22T13:32:47Z","abstract_excerpt":"A tangled-diagram over $[n]=\\{1,...,n\\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Generalizing the construction of Chen {\\it et.al.} we prove a bijection between generalized vacillating tableaux with less than $k$ rows and $k$-noncrossing tangled-diagrams and study their crossings and nestings. We show that the number of $k$-noncrossing and $k$-nonnesting tangled-diagrams are equal and enumerate tangled-diagrams."},"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":"0710.4053","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-10-22T13:32:47Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"06427abd74ada90084cedc3c46145963389c8960f3b214923fcc388edc6d878b","abstract_canon_sha256":"9f42165be0ff89775327c00c13b803610adbc8a3790bc5b4c1f2481c2ad7ed18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:13.993644Z","signature_b64":"W55Bt0P2SQBxc/ydHzYhJr4pS+CxIIuydEwKB1+CVOWN+TfVpD4NkJLY7xTG7pOmvCuhw12zG3rMtosanjZsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04adea0e903a41d20a0ccfa34636a7af96556b9ade509554e40e37ea8b87099f","last_reissued_at":"2026-05-18T04:09:13.993110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:13.993110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossings and nesting in tangled-diagrams","license":"","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Jing Qin, William Y. C. Chen","submitted_at":"2007-10-22T13:32:47Z","abstract_excerpt":"A tangled-diagram over $[n]=\\{1,...,n\\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Generalizing the construction of Chen {\\it et.al.} we prove a bijection between generalized vacillating tableaux with less than $k$ rows and $k$-noncrossing tangled-diagrams and study their crossings and nestings. We show that the number of $k$-noncrossing and $k$-nonnesting tangled-diagrams are equal and enumerate tangled-diagrams."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4053","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0710.4053","created_at":"2026-05-18T04:09:13.993199+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4053v2","created_at":"2026-05-18T04:09:13.993199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4053","created_at":"2026-05-18T04:09:13.993199+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASW6UDUQHJA5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASW6UDUQHJA5ECQM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASW6UDUQ","created_at":"2026-05-18T12:25:55.427421+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/ASW6UDUQHJA5ECQMZ6RUMNVHV6","json":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6.json","graph_json":"https://pith.science/api/pith-number/ASW6UDUQHJA5ECQMZ6RUMNVHV6/graph.json","events_json":"https://pith.science/api/pith-number/ASW6UDUQHJA5ECQMZ6RUMNVHV6/events.json","paper":"https://pith.science/paper/ASW6UDUQ"},"agent_actions":{"view_html":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6","download_json":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6.json","view_paper":"https://pith.science/paper/ASW6UDUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4053&json=true","fetch_graph":"https://pith.science/api/pith-number/ASW6UDUQHJA5ECQMZ6RUMNVHV6/graph.json","fetch_events":"https://pith.science/api/pith-number/ASW6UDUQHJA5ECQMZ6RUMNVHV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6/action/storage_attestation","attest_author":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6/action/author_attestation","sign_citation":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6/action/citation_signature","submit_replication":"https://pith.science/pith/ASW6UDUQHJA5ECQMZ6RUMNVHV6/action/replication_record"}},"created_at":"2026-05-18T04:09:13.993199+00:00","updated_at":"2026-05-18T04:09:13.993199+00:00"}