{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZIJXEX7XI6Y2Z6ZTELLB7I537P","short_pith_number":"pith:ZIJXEX7X","schema_version":"1.0","canonical_sha256":"ca13725ff747b1acfb3322d61fa3bbfbd1338d35354c4705a8e014d1aa15d6e5","source":{"kind":"arxiv","id":"1408.6764","version":2},"attestation_state":"computed","paper":{"title":"Path decompositions of digraphs and their applications to Weyl algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Askar Dzhumadil'daev, Damir Yeliussizov","submitted_at":"2014-08-28T16:08:19Z","abstract_excerpt":"We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem and helps to study skew-symmetric polynomials on certain subspaces of Weyl algebra. For instance, path decompositions can be used to study minimal polynomial identities on Weyl algebra, similar as Eulerian tours applicable for Amitsur--Levitzki theorem. We introduce the $G$-Stirling functions which enumerate decompositions by sources (and sinks) of paths."},"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":"1408.6764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-28T16:08:19Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"a780ecd47388250e855b63506effba6e1e61126ea94170618a79881376a87e66","abstract_canon_sha256":"94fcf41f45e1c841ff48ea9b9c02948b9afa2d6092aec3a6659dedc05e72ef40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.747725Z","signature_b64":"fLo/9K6QdYgjCXBoJ4yG+ApHdpAsdQIpjTr4clUofFUxi91IoZfCdcT9NfIAYmiF5gZtiSpIvFpY0heTWUctCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca13725ff747b1acfb3322d61fa3bbfbd1338d35354c4705a8e014d1aa15d6e5","last_reissued_at":"2026-05-18T02:20:28.747169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.747169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path decompositions of digraphs and their applications to Weyl algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Askar Dzhumadil'daev, Damir Yeliussizov","submitted_at":"2014-08-28T16:08:19Z","abstract_excerpt":"We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem and helps to study skew-symmetric polynomials on certain subspaces of Weyl algebra. For instance, path decompositions can be used to study minimal polynomial identities on Weyl algebra, similar as Eulerian tours applicable for Amitsur--Levitzki theorem. We introduce the $G$-Stirling functions which enumerate decompositions by sources (and sinks) of paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6764","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":"1408.6764","created_at":"2026-05-18T02:20:28.747251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6764v2","created_at":"2026-05-18T02:20:28.747251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6764","created_at":"2026-05-18T02:20:28.747251+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIJXEX7XI6Y2","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIJXEX7XI6Y2Z6ZT","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIJXEX7X","created_at":"2026-05-18T12:28:59.999130+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/ZIJXEX7XI6Y2Z6ZTELLB7I537P","json":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P.json","graph_json":"https://pith.science/api/pith-number/ZIJXEX7XI6Y2Z6ZTELLB7I537P/graph.json","events_json":"https://pith.science/api/pith-number/ZIJXEX7XI6Y2Z6ZTELLB7I537P/events.json","paper":"https://pith.science/paper/ZIJXEX7X"},"agent_actions":{"view_html":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P","download_json":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P.json","view_paper":"https://pith.science/paper/ZIJXEX7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6764&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIJXEX7XI6Y2Z6ZTELLB7I537P/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIJXEX7XI6Y2Z6ZTELLB7I537P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P/action/storage_attestation","attest_author":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P/action/author_attestation","sign_citation":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P/action/citation_signature","submit_replication":"https://pith.science/pith/ZIJXEX7XI6Y2Z6ZTELLB7I537P/action/replication_record"}},"created_at":"2026-05-18T02:20:28.747251+00:00","updated_at":"2026-05-18T02:20:28.747251+00:00"}