{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VT745BBFOHOE67AN5XUCSUYGOA","short_pith_number":"pith:VT745BBF","schema_version":"1.0","canonical_sha256":"acffce842571dc4f7c0dede82953067012c311356f55d88380a75c608ba20788","source":{"kind":"arxiv","id":"1411.3624","version":2},"attestation_state":"computed","paper":{"title":"What makes a D_0 graph Schur positive?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonah Blasiak","submitted_at":"2014-11-13T17:34:59Z","abstract_excerpt":"We define a D_0 graph to be a graph whose vertex set is a subset of permutations of n, with edges of the form ...bac... <--> ...bca... or ...acb... <--> ...cab... (Knuth transformations), or ...bac... <--> ...acb... or ...bca... <--> ...cab... (rotation transformations), such that whenever the Knuth and rotation transformations at positions i-1, i, i+1 are available at a vertex, exactly one of these is an edge. The generating function of such a graph is the sum of the quasisymmetric functions associated to the descent sets of its vertices. Assaf studied D_0 graphs in the paper *Dual equivalenc"},"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":"1411.3624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T17:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"7426b9df7e042caacd5f5f54a9130e05cf0350dec75fb545f6e73ce8597e2c5e","abstract_canon_sha256":"761450f5529c969cff8d436cc2b97c82e66c3b4bcfb39a8e2a3771b26a35a759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:48.346238Z","signature_b64":"tYh24C3Xl1/DqSctlGC5d372V+yZ5WrnOicwPWjsaFHZynWhgpiTuBVXEN+6NdeawhkiolJoEzASbmOAGq5fDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acffce842571dc4f7c0dede82953067012c311356f55d88380a75c608ba20788","last_reissued_at":"2026-05-18T00:54:48.345789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:48.345789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What makes a D_0 graph Schur positive?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonah Blasiak","submitted_at":"2014-11-13T17:34:59Z","abstract_excerpt":"We define a D_0 graph to be a graph whose vertex set is a subset of permutations of n, with edges of the form ...bac... <--> ...bca... or ...acb... <--> ...cab... (Knuth transformations), or ...bac... <--> ...acb... or ...bca... <--> ...cab... (rotation transformations), such that whenever the Knuth and rotation transformations at positions i-1, i, i+1 are available at a vertex, exactly one of these is an edge. The generating function of such a graph is the sum of the quasisymmetric functions associated to the descent sets of its vertices. Assaf studied D_0 graphs in the paper *Dual equivalenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3624","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":"1411.3624","created_at":"2026-05-18T00:54:48.345860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3624v2","created_at":"2026-05-18T00:54:48.345860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3624","created_at":"2026-05-18T00:54:48.345860+00:00"},{"alias_kind":"pith_short_12","alias_value":"VT745BBFOHOE","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VT745BBFOHOE67AN","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VT745BBF","created_at":"2026-05-18T12:28:54.890064+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/VT745BBFOHOE67AN5XUCSUYGOA","json":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA.json","graph_json":"https://pith.science/api/pith-number/VT745BBFOHOE67AN5XUCSUYGOA/graph.json","events_json":"https://pith.science/api/pith-number/VT745BBFOHOE67AN5XUCSUYGOA/events.json","paper":"https://pith.science/paper/VT745BBF"},"agent_actions":{"view_html":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA","download_json":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA.json","view_paper":"https://pith.science/paper/VT745BBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3624&json=true","fetch_graph":"https://pith.science/api/pith-number/VT745BBFOHOE67AN5XUCSUYGOA/graph.json","fetch_events":"https://pith.science/api/pith-number/VT745BBFOHOE67AN5XUCSUYGOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA/action/storage_attestation","attest_author":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA/action/author_attestation","sign_citation":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA/action/citation_signature","submit_replication":"https://pith.science/pith/VT745BBFOHOE67AN5XUCSUYGOA/action/replication_record"}},"created_at":"2026-05-18T00:54:48.345860+00:00","updated_at":"2026-05-18T00:54:48.345860+00:00"}