{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3RRVOPLI2P2F5AHPVKVO2PNI7C","short_pith_number":"pith:3RRVOPLI","canonical_record":{"source":{"id":"1605.00373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-02T07:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"9b79333659dcf38fb4c41e07990965c1258bf192a7c683e22bf8037faf22644d","abstract_canon_sha256":"8466ddc969a4f09cd2700bb40f8b16e0b0fca530aa39dc860425a01064461a00"},"schema_version":"1.0"},"canonical_sha256":"dc63573d68d3f45e80efaaaaed3da8f8a12ad7eebf500619cb3894979ae6773b","source":{"kind":"arxiv","id":"1605.00373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00373","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00373v1","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00373","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"3RRVOPLI2P2F","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3RRVOPLI2P2F5AHP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3RRVOPLI","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3RRVOPLI2P2F5AHPVKVO2PNI7C","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-02T07:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"9b79333659dcf38fb4c41e07990965c1258bf192a7c683e22bf8037faf22644d","abstract_canon_sha256":"8466ddc969a4f09cd2700bb40f8b16e0b0fca530aa39dc860425a01064461a00"},"schema_version":"1.0"},"canonical_sha256":"dc63573d68d3f45e80efaaaaed3da8f8a12ad7eebf500619cb3894979ae6773b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:55.995207Z","signature_b64":"67cisBiaQQV/nMIyXHM1YYEMeKu2+yHoKXfLNaxgwr934uZv0suv74NLtdOwwk/jXR6GYi3Gvqkz2JOl+s/SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc63573d68d3f45e80efaaaaed3da8f8a12ad7eebf500619cb3894979ae6773b","last_reissued_at":"2026-05-18T01:15:55.994594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:55.994594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00373","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-18T01:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Owz2k4xZz8AM0jF8SIbt88IOBzibOF9nwpbPGql948HHogjzWIFPWi0tZVg8mL+W7We7f67K3IS4U3HTp6bJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:25:47.096111Z"},"content_sha256":"e41a5b4a70ccb92077a8dcf72df95a5ddb1f65dc49da65f9df6bb193e597f2b9","schema_version":"1.0","event_id":"sha256:e41a5b4a70ccb92077a8dcf72df95a5ddb1f65dc49da65f9df6bb193e597f2b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3RRVOPLI2P2F5AHPVKVO2PNI7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Families of Subsets Without a Given Poset in the Interval Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Wei-Tian Li","submitted_at":"2016-05-02T07:27:49Z","abstract_excerpt":"For two posets $P$ and $Q$, we say $Q$ is $P$-free if there does not exist any order-preserving injection from $P$ to $Q$. The speical case for $Q$ being the Boolean lattice $B_n$ is well-studied, and the optiamal value is denoted as $\\lanp$. Let us define $\\La(Q,P)$ to be the largest size of any $P$-free subposet of $Q$.\n  In this paper, we give an upper bound for $\\La(Q,P)$ when $Q$ is a double chain and $P$ is any graded poset, which is better than the previous known upper bound, by means of finding the indpendence number of an auxiliary graph related to $P$. For the auxiliary graph, we can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00373","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-18T01:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PsKhn1wNCsLZRcoMz7tDtKPTead41PSvkFNZArV4cpQ580yHdFP7UEie3OgMRIH4tKBAdVIIr8BkjObt++MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:25:47.096616Z"},"content_sha256":"5b15f9d4cd79860a7c7ea4a5351f6850f5b8116110566ec4486f7ebab9282fdf","schema_version":"1.0","event_id":"sha256:5b15f9d4cd79860a7c7ea4a5351f6850f5b8116110566ec4486f7ebab9282fdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/bundle.json","state_url":"https://pith.science/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/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-09T00:25:47Z","links":{"resolver":"https://pith.science/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C","bundle":"https://pith.science/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/bundle.json","state":"https://pith.science/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RRVOPLI2P2F5AHPVKVO2PNI7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3RRVOPLI2P2F5AHPVKVO2PNI7C","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":"8466ddc969a4f09cd2700bb40f8b16e0b0fca530aa39dc860425a01064461a00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-02T07:27:49Z","title_canon_sha256":"9b79333659dcf38fb4c41e07990965c1258bf192a7c683e22bf8037faf22644d"},"schema_version":"1.0","source":{"id":"1605.00373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00373","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00373v1","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00373","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"3RRVOPLI2P2F","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3RRVOPLI2P2F5AHP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3RRVOPLI","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:5b15f9d4cd79860a7c7ea4a5351f6850f5b8116110566ec4486f7ebab9282fdf","target":"graph","created_at":"2026-05-18T01:15:55Z","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":"For two posets $P$ and $Q$, we say $Q$ is $P$-free if there does not exist any order-preserving injection from $P$ to $Q$. The speical case for $Q$ being the Boolean lattice $B_n$ is well-studied, and the optiamal value is denoted as $\\lanp$. Let us define $\\La(Q,P)$ to be the largest size of any $P$-free subposet of $Q$.\n  In this paper, we give an upper bound for $\\La(Q,P)$ when $Q$ is a double chain and $P$ is any graded poset, which is better than the previous known upper bound, by means of finding the indpendence number of an auxiliary graph related to $P$. For the auxiliary graph, we can","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Wei-Tian Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-02T07:27:49Z","title":"Families of Subsets Without a Given Poset in the Interval Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00373","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:e41a5b4a70ccb92077a8dcf72df95a5ddb1f65dc49da65f9df6bb193e597f2b9","target":"record","created_at":"2026-05-18T01:15:55Z","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":"8466ddc969a4f09cd2700bb40f8b16e0b0fca530aa39dc860425a01064461a00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-02T07:27:49Z","title_canon_sha256":"9b79333659dcf38fb4c41e07990965c1258bf192a7c683e22bf8037faf22644d"},"schema_version":"1.0","source":{"id":"1605.00373","kind":"arxiv","version":1}},"canonical_sha256":"dc63573d68d3f45e80efaaaaed3da8f8a12ad7eebf500619cb3894979ae6773b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc63573d68d3f45e80efaaaaed3da8f8a12ad7eebf500619cb3894979ae6773b","first_computed_at":"2026-05-18T01:15:55.994594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:55.994594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67cisBiaQQV/nMIyXHM1YYEMeKu2+yHoKXfLNaxgwr934uZv0suv74NLtdOwwk/jXR6GYi3Gvqkz2JOl+s/SAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:55.995207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e41a5b4a70ccb92077a8dcf72df95a5ddb1f65dc49da65f9df6bb193e597f2b9","sha256:5b15f9d4cd79860a7c7ea4a5351f6850f5b8116110566ec4486f7ebab9282fdf"],"state_sha256":"84157ed367485269ffafbd5ecc53adb896c1ddc0651df81f50fd4e83f3493625"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4YMXDTOg39JBgb3zT7fgPHkbzWizOQ9ke8s2pky3SVUBopJvXHHSpSt5ZFi8nH+Z992vC4qbHBe1/mTdm42Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:25:47.098597Z","bundle_sha256":"31c098fa7c37b0f5b1c6b6364b9156a2246ecc0a5405c72896f448f0f080bf5b"}}