{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S23PPFYJFJM2E5JXRNEVB5XA3R","short_pith_number":"pith:S23PPFYJ","canonical_record":{"source":{"id":"1611.09096","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T12:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"51f69ef06b6636238c94337e9bb18a77e17a569e8c9550d230b51f78a66c4422","abstract_canon_sha256":"f4a8d17e8aaf7b00cb18e1521299ee83b77d1a11b0da66d9008b78d494177c75"},"schema_version":"1.0"},"canonical_sha256":"96b6f797092a59a275378b4950f6e0dc5b170e4284a4e7fd11d499fb241e0365","source":{"kind":"arxiv","id":"1611.09096","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09096","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09096v4","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09096","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"S23PPFYJFJM2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S23PPFYJFJM2E5JX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S23PPFYJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S23PPFYJFJM2E5JXRNEVB5XA3R","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09096","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T12:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"51f69ef06b6636238c94337e9bb18a77e17a569e8c9550d230b51f78a66c4422","abstract_canon_sha256":"f4a8d17e8aaf7b00cb18e1521299ee83b77d1a11b0da66d9008b78d494177c75"},"schema_version":"1.0"},"canonical_sha256":"96b6f797092a59a275378b4950f6e0dc5b170e4284a4e7fd11d499fb241e0365","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:19.508247Z","signature_b64":"rorlGWk1o/i7/jt7n/GBGv3Pp40jktjLp6f+wKvBAj4DO9UFhJe0dmNyWizjsoKRr6uSWPYmAkNtGojReHn5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b6f797092a59a275378b4950f6e0dc5b170e4284a4e7fd11d499fb241e0365","last_reissued_at":"2026-05-18T00:40:19.507518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:19.507518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09096","source_version":4,"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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8muqjftDchJtrmU7QPjnFZj/30/ZYXwrpuCkm9YI2b9X4Gbtnfzjhi12vhvGE+4VeVTCXU88+ALnAa0w8V2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:27:24.888892Z"},"content_sha256":"7f8fb604ab7b386954c735787ca6051ddb94ac0199b8e9b801e1ded8073dc6c3","schema_version":"1.0","event_id":"sha256:7f8fb604ab7b386954c735787ca6051ddb94ac0199b8e9b801e1ded8073dc6c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S23PPFYJFJM2E5JXRNEVB5XA3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing 1-Plane Hamiltonian Cycles in Complete Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hazim Michman Trao","submitted_at":"2016-11-28T12:39:01Z","abstract_excerpt":"Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\\bf \\#P}-complete even if the graph is known to be planar \\cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric graphs to be 1-plane, that is, each of its edges is crossed at most once. We consider the following question: For any set $P\\/$ of $n\\/$ points in the plane, how many 1-plane Hamiltonian cycles can be packed into a complete geometric graph $K_n\\/$? We investigate the problem by taking two different situations of $P\\/$, namely, when $P\\/$ is in convex positio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09096","kind":"arxiv","version":4},"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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPcRKC+pBA6feAFeMaEdpThcUIhe3iNfXJh9lL2425S16Lx49nOJGtX3FQ/bTyLTzAGNuqKOM8sEvNOq3XbaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:27:24.889235Z"},"content_sha256":"7cb83599a6a2f05fdbfe312e565555b70405991f3e72e11dffc27cd7b0b624a4","schema_version":"1.0","event_id":"sha256:7cb83599a6a2f05fdbfe312e565555b70405991f3e72e11dffc27cd7b0b624a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/bundle.json","state_url":"https://pith.science/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/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-21T02:27:24Z","links":{"resolver":"https://pith.science/pith/S23PPFYJFJM2E5JXRNEVB5XA3R","bundle":"https://pith.science/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/bundle.json","state":"https://pith.science/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S23PPFYJFJM2E5JXRNEVB5XA3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S23PPFYJFJM2E5JXRNEVB5XA3R","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":"f4a8d17e8aaf7b00cb18e1521299ee83b77d1a11b0da66d9008b78d494177c75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T12:39:01Z","title_canon_sha256":"51f69ef06b6636238c94337e9bb18a77e17a569e8c9550d230b51f78a66c4422"},"schema_version":"1.0","source":{"id":"1611.09096","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09096","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09096v4","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09096","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"S23PPFYJFJM2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S23PPFYJFJM2E5JX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S23PPFYJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:7cb83599a6a2f05fdbfe312e565555b70405991f3e72e11dffc27cd7b0b624a4","target":"graph","created_at":"2026-05-18T00:40:19Z","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":"Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\\bf \\#P}-complete even if the graph is known to be planar \\cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric graphs to be 1-plane, that is, each of its edges is crossed at most once. We consider the following question: For any set $P\\/$ of $n\\/$ points in the plane, how many 1-plane Hamiltonian cycles can be packed into a complete geometric graph $K_n\\/$? We investigate the problem by taking two different situations of $P\\/$, namely, when $P\\/$ is in convex positio","authors_text":"Hazim Michman Trao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T12:39:01Z","title":"Packing 1-Plane Hamiltonian Cycles in Complete Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09096","kind":"arxiv","version":4},"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:7f8fb604ab7b386954c735787ca6051ddb94ac0199b8e9b801e1ded8073dc6c3","target":"record","created_at":"2026-05-18T00:40:19Z","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":"f4a8d17e8aaf7b00cb18e1521299ee83b77d1a11b0da66d9008b78d494177c75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T12:39:01Z","title_canon_sha256":"51f69ef06b6636238c94337e9bb18a77e17a569e8c9550d230b51f78a66c4422"},"schema_version":"1.0","source":{"id":"1611.09096","kind":"arxiv","version":4}},"canonical_sha256":"96b6f797092a59a275378b4950f6e0dc5b170e4284a4e7fd11d499fb241e0365","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b6f797092a59a275378b4950f6e0dc5b170e4284a4e7fd11d499fb241e0365","first_computed_at":"2026-05-18T00:40:19.507518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:19.507518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rorlGWk1o/i7/jt7n/GBGv3Pp40jktjLp6f+wKvBAj4DO9UFhJe0dmNyWizjsoKRr6uSWPYmAkNtGojReHn5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:19.508247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09096","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f8fb604ab7b386954c735787ca6051ddb94ac0199b8e9b801e1ded8073dc6c3","sha256:7cb83599a6a2f05fdbfe312e565555b70405991f3e72e11dffc27cd7b0b624a4"],"state_sha256":"0edcc018b4a5321334c1122783309c881c9888bfd47f0b63c0f63b45e8182f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3sDdQTndjUyK7ZuAmWbf6b3lVuOO4zL9A3lyyvBavk34J7oIvPme+uLweu4tNmf820FnDHv5rD5ZM1P5sP4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:27:24.891154Z","bundle_sha256":"ef9215aacd217f7a5d2c781313d941781eaf25bf55f8545813c3188c83306f01"}}