{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FIYWSRRXHWQXY4FUANTPUXDBCD","short_pith_number":"pith:FIYWSRRX","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"},"canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","source":{"kind":"arxiv","id":"1709.01768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01768","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01768v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01768","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"FIYWSRRXHWQX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIYWSRRXHWQXY4FU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIYWSRRX","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FIYWSRRXHWQXY4FUANTPUXDBCD","target":"record","payload":{"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"},"canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","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"},"source_kind":"arxiv","source_id":"1709.01768","source_version":1,"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-18T00:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUxP4ZNVRHTd1FyOkQhs1lNURbZauEHtG6fOg8Wzoi5DjNK+ZC/XL+/tDJ8WbPUtFHWG0dxRRFfGlqwogjY8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:23:40.263783Z"},"content_sha256":"c2beaca2713d3829416217bd2b7dcea078a7313423f47f4372cc7e12e31b3544","schema_version":"1.0","event_id":"sha256:c2beaca2713d3829416217bd2b7dcea078a7313423f47f4372cc7e12e31b3544"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FIYWSRRXHWQXY4FUANTPUXDBCD","target":"graph","payload":{"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"},"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-18T00:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMyEwsWGYJ03OJekXlKX3jCMrAUt7VEI4ygJ06FNKV05i+5dPOmMBd4pYgOnmbqBIY/girezMLKOGBbQELipBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:23:40.264473Z"},"content_sha256":"803daddf762e8f3335af76954d6760ed6be470f4cd407d2baf1563677f2dd336","schema_version":"1.0","event_id":"sha256:803daddf762e8f3335af76954d6760ed6be470f4cd407d2baf1563677f2dd336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/bundle.json","state_url":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/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-08T18:23:40Z","links":{"resolver":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD","bundle":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/bundle.json","state":"https://pith.science/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIYWSRRXHWQXY4FUANTPUXDBCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FIYWSRRXHWQXY4FUANTPUXDBCD","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":"96d4d77de2b6d21079106609e5b8b92e6908bc707f51d18730c87dc3d19f3772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T11:17:47Z","title_canon_sha256":"a1482f761e89bf8402fac2952604a8d488d32302fa55744179a9deade0415381"},"schema_version":"1.0","source":{"id":"1709.01768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01768","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01768v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01768","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"FIYWSRRXHWQX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIYWSRRXHWQXY4FU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIYWSRRX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:803daddf762e8f3335af76954d6760ed6be470f4cd407d2baf1563677f2dd336","target":"graph","created_at":"2026-05-18T00:35:54Z","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":"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","authors_text":"Wei-Tian Li, Yu-Lun Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T11:17:47Z","title":"Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01768","kind":"arxiv","version":1},"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:c2beaca2713d3829416217bd2b7dcea078a7313423f47f4372cc7e12e31b3544","target":"record","created_at":"2026-05-18T00:35:54Z","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":"96d4d77de2b6d21079106609e5b8b92e6908bc707f51d18730c87dc3d19f3772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T11:17:47Z","title_canon_sha256":"a1482f761e89bf8402fac2952604a8d488d32302fa55744179a9deade0415381"},"schema_version":"1.0","source":{"id":"1709.01768","kind":"arxiv","version":1}},"canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a316946373da17c70b40366fa5c6110f916bf318b977bc759b655dfb3f348cc","first_computed_at":"2026-05-18T00:35:54.394487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:54.394487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UR27Fmj4AXPwYwjxGU1KKifFlY74dcVHXl+IvzP96MTvp3vioPKGXcIrdeoIEQZ3Atog77ID6aeOjdbNAit8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:54.395182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2beaca2713d3829416217bd2b7dcea078a7313423f47f4372cc7e12e31b3544","sha256:803daddf762e8f3335af76954d6760ed6be470f4cd407d2baf1563677f2dd336"],"state_sha256":"011940fd7dd93d0e8af26d3db8400051b70fb5cd1e69dff258536bfde5c98e29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmzZA0/HbbYvymz0ydx1SpggfnNq3T0SG4OIEIV2bX5U/vOyMlIjqVzx9dMUmVaA3eWQ0UEuGBFv4fV689IpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:23:40.268447Z","bundle_sha256":"9f6157ab829e8b84a5c9bd6eb0f5f5e11a5192394322405f5e51602cf075f9f5"}}