{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OV3TJX3LPAHFWVPKYKJA6T5ALH","short_pith_number":"pith:OV3TJX3L","canonical_record":{"source":{"id":"2209.01270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T20:45:28Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"b7246c7b8630526d120f8425ef9ca1d7d8696c24f49c9b9eea3bfb490c7adbce","abstract_canon_sha256":"ca9282303bea76a004e916654c8321b18f4f58b6e6ab181a9217274ed159f655"},"schema_version":"1.0"},"canonical_sha256":"757734df6b780e5b55eac2920f4fa059cf272d8b38a637158c1fd9c1a65e2a34","source":{"kind":"arxiv","id":"2209.01270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01270","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01270v1","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01270","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"OV3TJX3LPAHF","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"OV3TJX3LPAHFWVPK","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"OV3TJX3L","created_at":"2026-07-05T04:54:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OV3TJX3LPAHFWVPKYKJA6T5ALH","target":"record","payload":{"canonical_record":{"source":{"id":"2209.01270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T20:45:28Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"b7246c7b8630526d120f8425ef9ca1d7d8696c24f49c9b9eea3bfb490c7adbce","abstract_canon_sha256":"ca9282303bea76a004e916654c8321b18f4f58b6e6ab181a9217274ed159f655"},"schema_version":"1.0"},"canonical_sha256":"757734df6b780e5b55eac2920f4fa059cf272d8b38a637158c1fd9c1a65e2a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:54:26.850268Z","signature_b64":"PGIOjsEr0B/jfAnxmMCswJiCKPDzfdpuaDBXUQKfor6XKd0YoA2Fq+kIlbVCDPTGFrq5H6RNKZIe0DTpjpEUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"757734df6b780e5b55eac2920f4fa059cf272d8b38a637158c1fd9c1a65e2a34","last_reissued_at":"2026-07-05T04:54:26.849869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:54:26.849869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.01270","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-07-05T04:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TID0DQu975p+U2EyHWl7Vxx5Y+sk19KCOueMO5lqvmaifwA0yb/x5yKzgOlWcVD/9ni3ZuS6Bg3TXDdevb31BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:23:12.571655Z"},"content_sha256":"cdc2f1c97539e1a1c2e8a09e76f8cf2a703ee0b4e47cef3449ddccb0dbc82f4c","schema_version":"1.0","event_id":"sha256:cdc2f1c97539e1a1c2e8a09e76f8cf2a703ee0b4e47cef3449ddccb0dbc82f4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OV3TJX3LPAHFWVPKYKJA6T5ALH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the arboreal jump number of a poset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Evellyn S. Cavalcante, Sebasti\\'an Urrutia, Vinicius F. dos Santos","submitted_at":"2022-09-02T20:45:28Z","abstract_excerpt":"A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find an arboreal extension of a given poset with minimum number of jumps. The contribution of this paper is twofold: (i)~a characterization that reveals a relation between the number of jumps of an arboreal order extension and the size of a partition of its elements that satisfy some structural properties of the covering graph; (ii)~a compact integer programming model and a heuristic to solve the arboreal jump number probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01270","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.01270/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS12cGZ+wNH86+wu/+lETIaHRKF2d/IGglxG3CJUZV4/dUPqgc/h3YGdYKJspKEelYrlxdUHwxdrdJJHW7nwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:23:12.572179Z"},"content_sha256":"957506a2aca715c38f9cc4cc75cb35b1814877bbce500ea8f1f0b87082c1fed5","schema_version":"1.0","event_id":"sha256:957506a2aca715c38f9cc4cc75cb35b1814877bbce500ea8f1f0b87082c1fed5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/bundle.json","state_url":"https://pith.science/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/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-08-19T04:23:12Z","links":{"resolver":"https://pith.science/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH","bundle":"https://pith.science/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/bundle.json","state":"https://pith.science/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV3TJX3LPAHFWVPKYKJA6T5ALH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OV3TJX3LPAHFWVPKYKJA6T5ALH","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":"ca9282303bea76a004e916654c8321b18f4f58b6e6ab181a9217274ed159f655","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T20:45:28Z","title_canon_sha256":"b7246c7b8630526d120f8425ef9ca1d7d8696c24f49c9b9eea3bfb490c7adbce"},"schema_version":"1.0","source":{"id":"2209.01270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01270","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01270v1","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01270","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"OV3TJX3LPAHF","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"OV3TJX3LPAHFWVPK","created_at":"2026-07-05T04:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"OV3TJX3L","created_at":"2026-07-05T04:54:26Z"}],"graph_snapshots":[{"event_id":"sha256:957506a2aca715c38f9cc4cc75cb35b1814877bbce500ea8f1f0b87082c1fed5","target":"graph","created_at":"2026-07-05T04:54:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.01270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find an arboreal extension of a given poset with minimum number of jumps. The contribution of this paper is twofold: (i)~a characterization that reveals a relation between the number of jumps of an arboreal order extension and the size of a partition of its elements that satisfy some structural properties of the covering graph; (ii)~a compact integer programming model and a heuristic to solve the arboreal jump number probl","authors_text":"Evellyn S. Cavalcante, Sebasti\\'an Urrutia, Vinicius F. dos Santos","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T20:45:28Z","title":"On the arboreal jump number of a poset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01270","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:cdc2f1c97539e1a1c2e8a09e76f8cf2a703ee0b4e47cef3449ddccb0dbc82f4c","target":"record","created_at":"2026-07-05T04:54:26Z","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":"ca9282303bea76a004e916654c8321b18f4f58b6e6ab181a9217274ed159f655","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T20:45:28Z","title_canon_sha256":"b7246c7b8630526d120f8425ef9ca1d7d8696c24f49c9b9eea3bfb490c7adbce"},"schema_version":"1.0","source":{"id":"2209.01270","kind":"arxiv","version":1}},"canonical_sha256":"757734df6b780e5b55eac2920f4fa059cf272d8b38a637158c1fd9c1a65e2a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"757734df6b780e5b55eac2920f4fa059cf272d8b38a637158c1fd9c1a65e2a34","first_computed_at":"2026-07-05T04:54:26.849869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:54:26.849869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGIOjsEr0B/jfAnxmMCswJiCKPDzfdpuaDBXUQKfor6XKd0YoA2Fq+kIlbVCDPTGFrq5H6RNKZIe0DTpjpEUAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:54:26.850268Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.01270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdc2f1c97539e1a1c2e8a09e76f8cf2a703ee0b4e47cef3449ddccb0dbc82f4c","sha256:957506a2aca715c38f9cc4cc75cb35b1814877bbce500ea8f1f0b87082c1fed5"],"state_sha256":"8faa4454bd0f6f488e86bdf4713f1740755718b2b35234c3f18eec7cd148549a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgjebJF04Fm1dVcANPPfIBKgikm5QNV6gi6XErOKZINe6OCb0qj1x30V2MxtNDFKMfXrpgxNgVIIaRN0sEZXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T04:23:12.577520Z","bundle_sha256":"039badc3294414f0d887576980104996f5b74649ae28d951b900c2cc14f994b5"}}