{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6DIGJXUOG6J53S4XRHDFF7QVBP","short_pith_number":"pith:6DIGJXUO","canonical_record":{"source":{"id":"1412.4062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-12T17:27:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3232cad324cb55688ae15d500471357995404601d72f9c474130b2e9d6e81657","abstract_canon_sha256":"904a0f752cbfd317b3139cc8a99be9fb63dacffb5d46056304be30d55424cd3e"},"schema_version":"1.0"},"canonical_sha256":"f0d064de8e3793ddcb9789c652fe150be36338c83ec3c3e7b4d61a4dc47498c2","source":{"kind":"arxiv","id":"1412.4062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4062","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4062v1","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4062","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"6DIGJXUOG6J5","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6DIGJXUOG6J53S4X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6DIGJXUO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6DIGJXUOG6J53S4XRHDFF7QVBP","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-12T17:27:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3232cad324cb55688ae15d500471357995404601d72f9c474130b2e9d6e81657","abstract_canon_sha256":"904a0f752cbfd317b3139cc8a99be9fb63dacffb5d46056304be30d55424cd3e"},"schema_version":"1.0"},"canonical_sha256":"f0d064de8e3793ddcb9789c652fe150be36338c83ec3c3e7b4d61a4dc47498c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.983484Z","signature_b64":"d39Sp4CIvU+K2t6v+2bwMKQrIQE2DthX6uqLmWv//HHko2aThWFIJViv+ttr9VNQy8IiVsQ6O64t8x4J+zf+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0d064de8e3793ddcb9789c652fe150be36338c83ec3c3e7b4d61a4dc47498c2","last_reissued_at":"2026-05-18T02:31:27.982973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.982973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4062","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-18T02:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMqVS7pBsGCsXAoUnzlJ8diGe++ypPoQFc0m+w9k9BKG/qkx71zpnNr+pztZ+LGzh5cB6d/ULQNVEv+OyKC5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:07:03.528652Z"},"content_sha256":"9464150ad7a8b6ea43e4bdc792d1c7e188f064a4ad28a71216ed5da9b6d14a33","schema_version":"1.0","event_id":"sha256:9464150ad7a8b6ea43e4bdc792d1c7e188f064a4ad28a71216ed5da9b6d14a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6DIGJXUOG6J53S4XRHDFF7QVBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Permutation Reconstruction from MinMax-Betweenness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Irena Rusu","submitted_at":"2014-12-12T17:27:15Z","abstract_excerpt":"In this paper, we investigate the reconstruction of permutations on {1, 2, ..., n} from betweenness constraints involving the minimum and the maximum element located between t and t+1, for all t=1, 2, ..., n-1. We propose two variants of the problem (directed and undirected), and focus first on the directed version, for which we draw up general features and design a polynomial algorithm in a particular case. Then, we investigate necessary and sufficient conditions for the uniqueness of the reconstruction in both directed and undirected versions, using a parameter k whose variation controls the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4062","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-18T02:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzOvLvNNaO+9EQ+F0RsrhFhIN2uPWlnFscdzZEmcPMuJL7EdAe6qZjeIUTS9/LZEu0Hg3V/JVGtYa2kdZQ0rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:07:03.529268Z"},"content_sha256":"9921ea9a2cf76e3057cf4d9e6624aac371ebcd8150154c582398db67adea01f4","schema_version":"1.0","event_id":"sha256:9921ea9a2cf76e3057cf4d9e6624aac371ebcd8150154c582398db67adea01f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/bundle.json","state_url":"https://pith.science/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/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-21T09:07:03Z","links":{"resolver":"https://pith.science/pith/6DIGJXUOG6J53S4XRHDFF7QVBP","bundle":"https://pith.science/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/bundle.json","state":"https://pith.science/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DIGJXUOG6J53S4XRHDFF7QVBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6DIGJXUOG6J53S4XRHDFF7QVBP","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":"904a0f752cbfd317b3139cc8a99be9fb63dacffb5d46056304be30d55424cd3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-12T17:27:15Z","title_canon_sha256":"3232cad324cb55688ae15d500471357995404601d72f9c474130b2e9d6e81657"},"schema_version":"1.0","source":{"id":"1412.4062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4062","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4062v1","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4062","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"6DIGJXUOG6J5","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6DIGJXUOG6J53S4X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6DIGJXUO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:9921ea9a2cf76e3057cf4d9e6624aac371ebcd8150154c582398db67adea01f4","target":"graph","created_at":"2026-05-18T02:31:27Z","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":"In this paper, we investigate the reconstruction of permutations on {1, 2, ..., n} from betweenness constraints involving the minimum and the maximum element located between t and t+1, for all t=1, 2, ..., n-1. We propose two variants of the problem (directed and undirected), and focus first on the directed version, for which we draw up general features and design a polynomial algorithm in a particular case. Then, we investigate necessary and sufficient conditions for the uniqueness of the reconstruction in both directed and undirected versions, using a parameter k whose variation controls the","authors_text":"Irena Rusu","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-12T17:27:15Z","title":"Permutation Reconstruction from MinMax-Betweenness Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4062","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:9464150ad7a8b6ea43e4bdc792d1c7e188f064a4ad28a71216ed5da9b6d14a33","target":"record","created_at":"2026-05-18T02:31:27Z","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":"904a0f752cbfd317b3139cc8a99be9fb63dacffb5d46056304be30d55424cd3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-12T17:27:15Z","title_canon_sha256":"3232cad324cb55688ae15d500471357995404601d72f9c474130b2e9d6e81657"},"schema_version":"1.0","source":{"id":"1412.4062","kind":"arxiv","version":1}},"canonical_sha256":"f0d064de8e3793ddcb9789c652fe150be36338c83ec3c3e7b4d61a4dc47498c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0d064de8e3793ddcb9789c652fe150be36338c83ec3c3e7b4d61a4dc47498c2","first_computed_at":"2026-05-18T02:31:27.982973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:27.982973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d39Sp4CIvU+K2t6v+2bwMKQrIQE2DthX6uqLmWv//HHko2aThWFIJViv+ttr9VNQy8IiVsQ6O64t8x4J+zf+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:27.983484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9464150ad7a8b6ea43e4bdc792d1c7e188f064a4ad28a71216ed5da9b6d14a33","sha256:9921ea9a2cf76e3057cf4d9e6624aac371ebcd8150154c582398db67adea01f4"],"state_sha256":"0d993c122cdcaf4eb89f7afcf6b9219115558b8a3c700ccbdec6011937c683d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70hM+F3ajbEAqxnpsA2OWN9SYb0YXSO3Vpg3j105teTaghgEf5Qia7v+fyusj9LYvm4cq4qfFMftl8k1gQwOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:07:03.532859Z","bundle_sha256":"aa2718f23fef1d0c033bc57c86375c11d0f5d97f30a66713e497bd4ee59b705b"}}