{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:75FP2VUKGJBHABSMMCRHTVE2JA","short_pith_number":"pith:75FP2VUK","canonical_record":{"source":{"id":"1501.06148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T12:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"c918d6249bc736e43ea7df912dae922f8c1e0df9a3d1e47860bb695bcbf20c57","abstract_canon_sha256":"06a8d604570b8bd69d4fba68a7ff18979d3473f336b02996d082182709dcc356"},"schema_version":"1.0"},"canonical_sha256":"ff4afd568a324270064c60a279d49a481252bef3617a2f63c89b4a08ade2fa8f","source":{"kind":"arxiv","id":"1501.06148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06148","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06148v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06148","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"75FP2VUKGJBH","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"75FP2VUKGJBHABSM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"75FP2VUK","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:75FP2VUKGJBHABSMMCRHTVE2JA","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T12:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"c918d6249bc736e43ea7df912dae922f8c1e0df9a3d1e47860bb695bcbf20c57","abstract_canon_sha256":"06a8d604570b8bd69d4fba68a7ff18979d3473f336b02996d082182709dcc356"},"schema_version":"1.0"},"canonical_sha256":"ff4afd568a324270064c60a279d49a481252bef3617a2f63c89b4a08ade2fa8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:42.232364Z","signature_b64":"7IneqOcsgji70wrCm4Hi+yRxVdzxAqcSNou4gopiHoiKxLZ6zZnxlz/5O0tUlK7lkQfMuGiLRKIYi4GEijdfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff4afd568a324270064c60a279d49a481252bef3617a2f63c89b4a08ade2fa8f","last_reissued_at":"2026-05-18T02:28:42.231753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:42.231753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06148","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:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTucQF62rpk+g1vk/UPAoS2CAPDmUBlgL7brVJaNAF8QH5Ah1Ge5s9/B65Jh5fhzQYn0wGnsnywzqMqzkSHXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:57:41.353967Z"},"content_sha256":"611281b2e839a05dd047f4cd520cbfcce7d53b8dc22892202bfc1c170822df16","schema_version":"1.0","event_id":"sha256:611281b2e839a05dd047f4cd520cbfcce7d53b8dc22892202bfc1c170822df16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:75FP2VUKGJBHABSMMCRHTVE2JA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tie-break model for graph search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Derek G. Corneil, Fabien de Montgolfier, Jeremie Dusart, Michel Habib","submitted_at":"2015-01-25T12:45:29Z","abstract_excerpt":"In this paper, we consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS), in order to handle a broad variety of searches. This new model is based on partial orders defined on the label set and it unifies the General Label Search (GLS) formalism of Krueger, Simonet and Berry (2011), and the \"pattern-conditions\" formalism of Corneil and Krueger (2008). It allows us to derive some general properties including new pattern-conditions (yielding memory-efficient certificates) for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06148","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:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxdQPy4WTutEY5xcifydNhCA3hl3VT2GsHaEMias2mcJRXbk5r8X4bPHktnojdMUjd5ZOVV5hf8XNhhxI95UBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:57:41.354324Z"},"content_sha256":"6b574f0df831549dd748f35e1132ddd32a59cd3bb70f41b748ab05a8ca6f7d2b","schema_version":"1.0","event_id":"sha256:6b574f0df831549dd748f35e1132ddd32a59cd3bb70f41b748ab05a8ca6f7d2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75FP2VUKGJBHABSMMCRHTVE2JA/bundle.json","state_url":"https://pith.science/pith/75FP2VUKGJBHABSMMCRHTVE2JA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75FP2VUKGJBHABSMMCRHTVE2JA/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-05T14:57:41Z","links":{"resolver":"https://pith.science/pith/75FP2VUKGJBHABSMMCRHTVE2JA","bundle":"https://pith.science/pith/75FP2VUKGJBHABSMMCRHTVE2JA/bundle.json","state":"https://pith.science/pith/75FP2VUKGJBHABSMMCRHTVE2JA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75FP2VUKGJBHABSMMCRHTVE2JA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:75FP2VUKGJBHABSMMCRHTVE2JA","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":"06a8d604570b8bd69d4fba68a7ff18979d3473f336b02996d082182709dcc356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T12:45:29Z","title_canon_sha256":"c918d6249bc736e43ea7df912dae922f8c1e0df9a3d1e47860bb695bcbf20c57"},"schema_version":"1.0","source":{"id":"1501.06148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06148","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06148v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06148","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"75FP2VUKGJBH","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"75FP2VUKGJBHABSM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"75FP2VUK","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:6b574f0df831549dd748f35e1132ddd32a59cd3bb70f41b748ab05a8ca6f7d2b","target":"graph","created_at":"2026-05-18T02:28:42Z","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 consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS), in order to handle a broad variety of searches. This new model is based on partial orders defined on the label set and it unifies the General Label Search (GLS) formalism of Krueger, Simonet and Berry (2011), and the \"pattern-conditions\" formalism of Corneil and Krueger (2008). It allows us to derive some general properties including new pattern-conditions (yielding memory-efficient certificates) for","authors_text":"Derek G. Corneil, Fabien de Montgolfier, Jeremie Dusart, Michel Habib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T12:45:29Z","title":"A tie-break model for graph search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06148","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:611281b2e839a05dd047f4cd520cbfcce7d53b8dc22892202bfc1c170822df16","target":"record","created_at":"2026-05-18T02:28:42Z","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":"06a8d604570b8bd69d4fba68a7ff18979d3473f336b02996d082182709dcc356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T12:45:29Z","title_canon_sha256":"c918d6249bc736e43ea7df912dae922f8c1e0df9a3d1e47860bb695bcbf20c57"},"schema_version":"1.0","source":{"id":"1501.06148","kind":"arxiv","version":1}},"canonical_sha256":"ff4afd568a324270064c60a279d49a481252bef3617a2f63c89b4a08ade2fa8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff4afd568a324270064c60a279d49a481252bef3617a2f63c89b4a08ade2fa8f","first_computed_at":"2026-05-18T02:28:42.231753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:42.231753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7IneqOcsgji70wrCm4Hi+yRxVdzxAqcSNou4gopiHoiKxLZ6zZnxlz/5O0tUlK7lkQfMuGiLRKIYi4GEijdfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:42.232364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:611281b2e839a05dd047f4cd520cbfcce7d53b8dc22892202bfc1c170822df16","sha256:6b574f0df831549dd748f35e1132ddd32a59cd3bb70f41b748ab05a8ca6f7d2b"],"state_sha256":"957b974ad7248a5b94781b6537e987d0efa3d49b9c6a5e92ab2d4fa89cd4f640"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24DUiwyATfZIDNT6OdpSoi1iAvzWsytrPPgJ5agdosfL/uMZSjJSh2v/jeFF2eVOb15z1tiFZUMzCpUv1EAKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:57:41.356291Z","bundle_sha256":"e72cd82acba61172fe0c35879261a275a4d43d76aefae6ca8dc3518a9b447639"}}