{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FIYWSRRXHWQXY4FUANTPUXDBCD","short_pith_number":"pith:FIYWSRRX","schema_version":"1.0","canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","source":{"kind":"arxiv","id":"1709.01768","version":1},"attestation_state":"computed","paper":{"title":"Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei-Tian Li, Yu-Lun Chang","submitted_at":"2017-09-06T11:17:47Z","abstract_excerpt":"Given a graded poset $P$, consider a chain decomposition $\\mathcal{C}$ of $P$. If $|C_1|\\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\\in \\mathcal{C}$, then we say $\\mathcal{C}$ is a nested chain decomposition (or nesting, for short) of $P$, and $P$ is said to be nested. In 1970s, Griggs conjectured that every normalized matching rank-unimodal poset is nested. This conjecture is proved to be true only for all posets of rank 2 [W:05], some posets of rank 3 [HLS:09,ENSST:11], and the very special cases for h"},"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":"1709.01768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T11:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"a1482f761e89bf8402fac2952604a8d488d32302fa55744179a9deade0415381","abstract_canon_sha256":"96d4d77de2b6d21079106609e5b8b92e6908bc707f51d18730c87dc3d19f3772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:54.395182Z","signature_b64":"UR27Fmj4AXPwYwjxGU1KKifFlY74dcVHXl+IvzP96MTvp3vioPKGXcIrdeoIEQZ3Atog77ID6aeOjdbNAit8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","last_reissued_at":"2026-05-18T00:35:54.394487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:54.394487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei-Tian Li, Yu-Lun Chang","submitted_at":"2017-09-06T11:17:47Z","abstract_excerpt":"Given a graded poset $P$, consider a chain decomposition $\\mathcal{C}$ of $P$. If $|C_1|\\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\\in \\mathcal{C}$, then we say $\\mathcal{C}$ is a nested chain decomposition (or nesting, for short) of $P$, and $P$ is said to be nested. In 1970s, Griggs conjectured that every normalized matching rank-unimodal poset is nested. This conjecture is proved to be true only for all posets of rank 2 [W:05], some posets of rank 3 [HLS:09,ENSST:11], and the very special cases for h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01768","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":"1709.01768","created_at":"2026-05-18T00:35:54.394595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01768v1","created_at":"2026-05-18T00:35:54.394595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01768","created_at":"2026-05-18T00:35:54.394595+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIYWSRRXHWQX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIYWSRRXHWQXY4FU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIYWSRRX","created_at":"2026-05-18T12:31:15.632608+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/FIYWSRRXHWQXY4FUANTPUXDBCD","json":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD.json","graph_json":"https://pith.science/api/pith-number/FIYWSRRXHWQXY4FUANTPUXDBCD/graph.json","events_json":"https://pith.science/api/pith-number/FIYWSRRXHWQXY4FUANTPUXDBCD/events.json","paper":"https://pith.science/paper/FIYWSRRX"},"agent_actions":{"view_html":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD","download_json":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD.json","view_paper":"https://pith.science/paper/FIYWSRRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01768&json=true","fetch_graph":"https://pith.science/api/pith-number/FIYWSRRXHWQXY4FUANTPUXDBCD/graph.json","fetch_events":"https://pith.science/api/pith-number/FIYWSRRXHWQXY4FUANTPUXDBCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/action/storage_attestation","attest_author":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/action/author_attestation","sign_citation":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/action/citation_signature","submit_replication":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/action/replication_record"}},"created_at":"2026-05-18T00:35:54.394595+00:00","updated_at":"2026-05-18T00:35:54.394595+00:00"}