{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RKPGIZ2YUTWGBLEJVXLLFXNFPI","short_pith_number":"pith:RKPGIZ2Y","canonical_record":{"source":{"id":"1609.09746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T14:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"ecb1aca751101f1c148382316fea48ddbf2efb4fc8b2ca9a11d0ae3a1c8e6a33","abstract_canon_sha256":"a6839450e61695bb6e6694fa7befa979d0b35d1ed1a480a792ecf56c49568d8f"},"schema_version":"1.0"},"canonical_sha256":"8a9e646758a4ec60ac89add6b2dda57a358b4e774f2e3f2c55ea6371065d162b","source":{"kind":"arxiv","id":"1609.09746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09746","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09746v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09746","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"RKPGIZ2YUTWG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKPGIZ2YUTWGBLEJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKPGIZ2Y","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RKPGIZ2YUTWGBLEJVXLLFXNFPI","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T14:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"ecb1aca751101f1c148382316fea48ddbf2efb4fc8b2ca9a11d0ae3a1c8e6a33","abstract_canon_sha256":"a6839450e61695bb6e6694fa7befa979d0b35d1ed1a480a792ecf56c49568d8f"},"schema_version":"1.0"},"canonical_sha256":"8a9e646758a4ec60ac89add6b2dda57a358b4e774f2e3f2c55ea6371065d162b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:33.529684Z","signature_b64":"gXcsfNQnpbOJDIfXhX+ntkJgXiJzSwvKmGQCtRe8yTRrOgzHFjlMFRSW/0eKdmCXYISnbn5/h67wynZLXCuRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a9e646758a4ec60ac89add6b2dda57a358b4e774f2e3f2c55ea6371065d162b","last_reissued_at":"2026-05-18T01:03:33.529069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:33.529069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09746","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:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Y8qfiv5UxVEH8Gi7Ob/YWfQlP3fPTvuLi4vykPsGjFYyNdrhbl434IxauZ2tzQysDCv6IsKLfU7plJ7CsVsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:02:17.429300Z"},"content_sha256":"0084d5c922d506804a6aad6c67baf597bb8e620858788db9cde2b380db05aacf","schema_version":"1.0","event_id":"sha256:0084d5c922d506804a6aad6c67baf597bb8e620858788db9cde2b380db05aacf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RKPGIZ2YUTWGBLEJVXLLFXNFPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independent sets in the union of two Hamiltonian cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Solt\\'esz, Ron Aharoni","submitted_at":"2016-09-30T14:19:35Z","abstract_excerpt":"Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by $f(n,k)$: the maximal number of Hamiltonian cycles on an $n$ element set, such that no two cycles share a common independent set of size more than $k$. We shall mainly be interested in the behavior of $f(n,k)$ when $k$ is a linear function of $n$, namely $k=cn$. We show a threshold phenomenon: there exists a constant $c_t$ such that for $c<c_t$, $f(n,cn)$ is bounded by a constant depending only on $c$ and not on $n$, and for $c_t <c$, $f(n,cn)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09746","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:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYvuo1PJ3YD0z+qTN/vzhVMSQ3yODbN+yNUS0NgS9yx5njs8YY6hbLJ+Gi/ps4BG8H5xvK4Jn2s0ftAVb1cNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:02:17.429800Z"},"content_sha256":"b29bdf81d8fc7c063f3bda32bb33938c6c0f1567382cd6b593fbac1662e2d310","schema_version":"1.0","event_id":"sha256:b29bdf81d8fc7c063f3bda32bb33938c6c0f1567382cd6b593fbac1662e2d310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/bundle.json","state_url":"https://pith.science/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/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-05-23T10:02:17Z","links":{"resolver":"https://pith.science/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI","bundle":"https://pith.science/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/bundle.json","state":"https://pith.science/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKPGIZ2YUTWGBLEJVXLLFXNFPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RKPGIZ2YUTWGBLEJVXLLFXNFPI","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":"a6839450e61695bb6e6694fa7befa979d0b35d1ed1a480a792ecf56c49568d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T14:19:35Z","title_canon_sha256":"ecb1aca751101f1c148382316fea48ddbf2efb4fc8b2ca9a11d0ae3a1c8e6a33"},"schema_version":"1.0","source":{"id":"1609.09746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09746","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09746v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09746","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"RKPGIZ2YUTWG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKPGIZ2YUTWGBLEJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKPGIZ2Y","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b29bdf81d8fc7c063f3bda32bb33938c6c0f1567382cd6b593fbac1662e2d310","target":"graph","created_at":"2026-05-18T01:03:33Z","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":"Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by $f(n,k)$: the maximal number of Hamiltonian cycles on an $n$ element set, such that no two cycles share a common independent set of size more than $k$. We shall mainly be interested in the behavior of $f(n,k)$ when $k$ is a linear function of $n$, namely $k=cn$. We show a threshold phenomenon: there exists a constant $c_t$ such that for $c<c_t$, $f(n,cn)$ is bounded by a constant depending only on $c$ and not on $n$, and for $c_t <c$, $f(n,cn)","authors_text":"Daniel Solt\\'esz, Ron Aharoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T14:19:35Z","title":"Independent sets in the union of two Hamiltonian cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09746","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:0084d5c922d506804a6aad6c67baf597bb8e620858788db9cde2b380db05aacf","target":"record","created_at":"2026-05-18T01:03:33Z","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":"a6839450e61695bb6e6694fa7befa979d0b35d1ed1a480a792ecf56c49568d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T14:19:35Z","title_canon_sha256":"ecb1aca751101f1c148382316fea48ddbf2efb4fc8b2ca9a11d0ae3a1c8e6a33"},"schema_version":"1.0","source":{"id":"1609.09746","kind":"arxiv","version":1}},"canonical_sha256":"8a9e646758a4ec60ac89add6b2dda57a358b4e774f2e3f2c55ea6371065d162b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a9e646758a4ec60ac89add6b2dda57a358b4e774f2e3f2c55ea6371065d162b","first_computed_at":"2026-05-18T01:03:33.529069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:33.529069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXcsfNQnpbOJDIfXhX+ntkJgXiJzSwvKmGQCtRe8yTRrOgzHFjlMFRSW/0eKdmCXYISnbn5/h67wynZLXCuRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:33.529684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0084d5c922d506804a6aad6c67baf597bb8e620858788db9cde2b380db05aacf","sha256:b29bdf81d8fc7c063f3bda32bb33938c6c0f1567382cd6b593fbac1662e2d310"],"state_sha256":"8b6fd5095b7f207a4d385a2a8a4be6bffe3a55fb8585547f3b30a619ca3f344f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEQ3/QMfFK4/GAfRfn+jepIzKiPeFbIra8D3AXxHMF7riEUL2Vl9/NerQZpdUBpM3L+0Tl1ShGpPW8We5aWoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T10:02:17.432945Z","bundle_sha256":"8813c23e4f0f73347b16d83d6ff1a75c578ac0eb256f04efe954e6976340ecca"}}