{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O7XIBUUETS6GRKJXBHGA26H55S","short_pith_number":"pith:O7XIBUUE","canonical_record":{"source":{"id":"1511.04282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-13T14:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"08881c91bc6b841cf180bb51aba26144059f072e0b5a1478b28a0694ebfd4549","abstract_canon_sha256":"26f5cea950d2bcffe056c09bf09c76dad5745ac5b4b01d577bbf9744f9386839"},"schema_version":"1.0"},"canonical_sha256":"77ee80d2849cbc68a93709cc0d78fdecac5e599b6c8fcdd2b1df1ab57afb06e4","source":{"kind":"arxiv","id":"1511.04282","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04282","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04282v2","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04282","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"O7XIBUUETS6G","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7XIBUUETS6GRKJX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7XIBUUE","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O7XIBUUETS6GRKJXBHGA26H55S","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-13T14:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"08881c91bc6b841cf180bb51aba26144059f072e0b5a1478b28a0694ebfd4549","abstract_canon_sha256":"26f5cea950d2bcffe056c09bf09c76dad5745ac5b4b01d577bbf9744f9386839"},"schema_version":"1.0"},"canonical_sha256":"77ee80d2849cbc68a93709cc0d78fdecac5e599b6c8fcdd2b1df1ab57afb06e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:25.110040Z","signature_b64":"KgJlteesXVwfi2j11zYW3eRuKqzFpfv9aNwIw5+ktbOojn4k8ieTdMcMES77ExMztiW/6s6Dhr6g8SMf4ITXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ee80d2849cbc68a93709cc0d78fdecac5e599b6c8fcdd2b1df1ab57afb06e4","last_reissued_at":"2026-05-18T00:49:25.109340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:25.109340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04282","source_version":2,"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:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znVmJB+hZWEdLHwEd958Es/sD+J8tixJpgE5IC+jblIF3dQ1ympxDgZA6kGBpGcHMUoWEp6CUyum7YrlhGmKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:58.568253Z"},"content_sha256":"db7024cd27e7f8b602d87d788f19ea650414077d3390c2fd8f82ef403bc3fcc5","schema_version":"1.0","event_id":"sha256:db7024cd27e7f8b602d87d788f19ea650414077d3390c2fd8f82ef403bc3fcc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O7XIBUUETS6GRKJXBHGA26H55S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Instability of Matching Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ohad Perry, Pascal Moyal","submitted_at":"2015-11-13T14:10:07Z","abstract_excerpt":"A matching queue is described via a graph $G$ together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can either be queued, or matched with queued items in neighboring nodes. The matching policy specifies how items are matched whenever more than one matching is possible. Motivated by the increasing theoretical interest in such matching models, we investigate the question of (in)stability of matching queues which satisfy a natural necessary condition for stability, which can be thought of as an analogue of the usual traffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04282","kind":"arxiv","version":2},"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:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDYupaySInn/igbZLPe4LTCZmMYoXwRJw2QzTWvfVr+CdAv5CBbgUtHo31S6bNGDWVLWEbLH5TlQhnWcfUm2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:58.568609Z"},"content_sha256":"b2c5b06a85d097a54a3f5f85eee9550860063b7dd9fe4dc9f6e15491094861c9","schema_version":"1.0","event_id":"sha256:b2c5b06a85d097a54a3f5f85eee9550860063b7dd9fe4dc9f6e15491094861c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7XIBUUETS6GRKJXBHGA26H55S/bundle.json","state_url":"https://pith.science/pith/O7XIBUUETS6GRKJXBHGA26H55S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7XIBUUETS6GRKJXBHGA26H55S/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-07-02T18:53:58Z","links":{"resolver":"https://pith.science/pith/O7XIBUUETS6GRKJXBHGA26H55S","bundle":"https://pith.science/pith/O7XIBUUETS6GRKJXBHGA26H55S/bundle.json","state":"https://pith.science/pith/O7XIBUUETS6GRKJXBHGA26H55S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7XIBUUETS6GRKJXBHGA26H55S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O7XIBUUETS6GRKJXBHGA26H55S","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":"26f5cea950d2bcffe056c09bf09c76dad5745ac5b4b01d577bbf9744f9386839","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-13T14:10:07Z","title_canon_sha256":"08881c91bc6b841cf180bb51aba26144059f072e0b5a1478b28a0694ebfd4549"},"schema_version":"1.0","source":{"id":"1511.04282","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04282","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04282v2","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04282","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"O7XIBUUETS6G","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7XIBUUETS6GRKJX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7XIBUUE","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:b2c5b06a85d097a54a3f5f85eee9550860063b7dd9fe4dc9f6e15491094861c9","target":"graph","created_at":"2026-05-18T00:49:25Z","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":"A matching queue is described via a graph $G$ together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can either be queued, or matched with queued items in neighboring nodes. The matching policy specifies how items are matched whenever more than one matching is possible. Motivated by the increasing theoretical interest in such matching models, we investigate the question of (in)stability of matching queues which satisfy a natural necessary condition for stability, which can be thought of as an analogue of the usual traffi","authors_text":"Ohad Perry, Pascal Moyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-13T14:10:07Z","title":"On the Instability of Matching Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04282","kind":"arxiv","version":2},"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:db7024cd27e7f8b602d87d788f19ea650414077d3390c2fd8f82ef403bc3fcc5","target":"record","created_at":"2026-05-18T00:49:25Z","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":"26f5cea950d2bcffe056c09bf09c76dad5745ac5b4b01d577bbf9744f9386839","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-13T14:10:07Z","title_canon_sha256":"08881c91bc6b841cf180bb51aba26144059f072e0b5a1478b28a0694ebfd4549"},"schema_version":"1.0","source":{"id":"1511.04282","kind":"arxiv","version":2}},"canonical_sha256":"77ee80d2849cbc68a93709cc0d78fdecac5e599b6c8fcdd2b1df1ab57afb06e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ee80d2849cbc68a93709cc0d78fdecac5e599b6c8fcdd2b1df1ab57afb06e4","first_computed_at":"2026-05-18T00:49:25.109340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:25.109340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KgJlteesXVwfi2j11zYW3eRuKqzFpfv9aNwIw5+ktbOojn4k8ieTdMcMES77ExMztiW/6s6Dhr6g8SMf4ITXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:25.110040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04282","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7024cd27e7f8b602d87d788f19ea650414077d3390c2fd8f82ef403bc3fcc5","sha256:b2c5b06a85d097a54a3f5f85eee9550860063b7dd9fe4dc9f6e15491094861c9"],"state_sha256":"fb7663656628f41c9f18efe97d7b0fc2579921b68255a29b8f5bf8b1a5c1e7fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiFP6kyF7WEn0Qh6acY+on5EWlp9M+APeEzeNiuPGhzIm2bqPO1mNnMNrcTsiL+ExQ5o9atKW+nLH8izi8c8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T18:53:58.570546Z","bundle_sha256":"6e83d4643deed41d9f4576d55f4aeb6039cac9c187193e106f2dc2a0a86d1d2d"}}