{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4GIZZWZBQ4KO74FYTEPFDCWB2H","short_pith_number":"pith:4GIZZWZB","canonical_record":{"source":{"id":"2305.07294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-12T07:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"05418318b3f9c4491beab358de609eef58d57ac75b86588574a8be624a35ff79","abstract_canon_sha256":"d66e33d126fc867ce49fe63211b69bc4309fb1770b7f8db388bdb6f15cb2ae67"},"schema_version":"1.0"},"canonical_sha256":"e1919cdb218714eff0b8991e518ac1d1d4a8a7a8c3d5472dd64de4d638f1caf8","source":{"kind":"arxiv","id":"2305.07294","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.07294","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.07294v2","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07294","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"4GIZZWZBQ4KO","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_16","alias_value":"4GIZZWZBQ4KO74FY","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_8","alias_value":"4GIZZWZB","created_at":"2026-07-05T07:01:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4GIZZWZBQ4KO74FYTEPFDCWB2H","target":"record","payload":{"canonical_record":{"source":{"id":"2305.07294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-12T07:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"05418318b3f9c4491beab358de609eef58d57ac75b86588574a8be624a35ff79","abstract_canon_sha256":"d66e33d126fc867ce49fe63211b69bc4309fb1770b7f8db388bdb6f15cb2ae67"},"schema_version":"1.0"},"canonical_sha256":"e1919cdb218714eff0b8991e518ac1d1d4a8a7a8c3d5472dd64de4d638f1caf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:41.253782Z","signature_b64":"YT9HeaJJ8RNvpYFZmrENijZt4TyqvSWaDClcGPqSVP7kAEesXC8kyf7SeLsEI9OOABsnKLjzuNsIw7sx0IWdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1919cdb218714eff0b8991e518ac1d1d4a8a7a8c3d5472dd64de4d638f1caf8","last_reissued_at":"2026-07-05T07:01:41.253262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:41.253262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.07294","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-07-05T07:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akj/gMsp2xgj2fTQqo3/bBryieXsNvBPEipc9d91kMULY4C1yzcU/4HSo0mSqa+2Kuj13YeXpuSz13OlP8P0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:36:57.015120Z"},"content_sha256":"36e053fb14efda655b22d631f24b50f773929752689fc8d11fc4d8720aa8ac69","schema_version":"1.0","event_id":"sha256:36e053fb14efda655b22d631f24b50f773929752689fc8d11fc4d8720aa8ac69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4GIZZWZBQ4KO74FYTEPFDCWB2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiling edge-ordered graphs with monotone paths and other structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Igor Araujo, Sim\\'on Piga, Zimu Xiang","submitted_at":"2023-05-12T07:53:46Z","abstract_excerpt":"Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the K\\\"uhn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07294","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.07294/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-05T07:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwjJcsuWZlWAMqyoUsO27t/YZXPnOyXJEDchFaSUVQpgv4cEoFm8Z58++GMxyl+D5fKiFeEiTXs8KpN1AxNNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:36:57.015519Z"},"content_sha256":"ae3b1a345671a546ee00b85a625f1bc9243f20b328eca8427a2a53710de00a42","schema_version":"1.0","event_id":"sha256:ae3b1a345671a546ee00b85a625f1bc9243f20b328eca8427a2a53710de00a42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/bundle.json","state_url":"https://pith.science/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/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-07T07:36:57Z","links":{"resolver":"https://pith.science/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H","bundle":"https://pith.science/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/bundle.json","state":"https://pith.science/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GIZZWZBQ4KO74FYTEPFDCWB2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4GIZZWZBQ4KO74FYTEPFDCWB2H","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":"d66e33d126fc867ce49fe63211b69bc4309fb1770b7f8db388bdb6f15cb2ae67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-12T07:53:46Z","title_canon_sha256":"05418318b3f9c4491beab358de609eef58d57ac75b86588574a8be624a35ff79"},"schema_version":"1.0","source":{"id":"2305.07294","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.07294","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.07294v2","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07294","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"4GIZZWZBQ4KO","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_16","alias_value":"4GIZZWZBQ4KO74FY","created_at":"2026-07-05T07:01:41Z"},{"alias_kind":"pith_short_8","alias_value":"4GIZZWZB","created_at":"2026-07-05T07:01:41Z"}],"graph_snapshots":[{"event_id":"sha256:ae3b1a345671a546ee00b85a625f1bc9243f20b328eca8427a2a53710de00a42","target":"graph","created_at":"2026-07-05T07:01:41Z","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/2305.07294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the K\\\"uhn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the","authors_text":"Andrew Treglown, Igor Araujo, Sim\\'on Piga, Zimu Xiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-12T07:53:46Z","title":"Tiling edge-ordered graphs with monotone paths and other structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07294","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:36e053fb14efda655b22d631f24b50f773929752689fc8d11fc4d8720aa8ac69","target":"record","created_at":"2026-07-05T07:01:41Z","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":"d66e33d126fc867ce49fe63211b69bc4309fb1770b7f8db388bdb6f15cb2ae67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-12T07:53:46Z","title_canon_sha256":"05418318b3f9c4491beab358de609eef58d57ac75b86588574a8be624a35ff79"},"schema_version":"1.0","source":{"id":"2305.07294","kind":"arxiv","version":2}},"canonical_sha256":"e1919cdb218714eff0b8991e518ac1d1d4a8a7a8c3d5472dd64de4d638f1caf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1919cdb218714eff0b8991e518ac1d1d4a8a7a8c3d5472dd64de4d638f1caf8","first_computed_at":"2026-07-05T07:01:41.253262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:01:41.253262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YT9HeaJJ8RNvpYFZmrENijZt4TyqvSWaDClcGPqSVP7kAEesXC8kyf7SeLsEI9OOABsnKLjzuNsIw7sx0IWdBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:01:41.253782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.07294","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e053fb14efda655b22d631f24b50f773929752689fc8d11fc4d8720aa8ac69","sha256:ae3b1a345671a546ee00b85a625f1bc9243f20b328eca8427a2a53710de00a42"],"state_sha256":"9dd9c8eaac5bc8ce5d5502106516dc887e6547866580d44896652ece089571aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWZ7nmgQ+MFqU0HknAVxHdhrIYtFfya+c9+b8LZiFs577ai9WBBuTAin4+NYmhMVcg4eXGWzO4gbqmj/go96AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:36:57.018020Z","bundle_sha256":"c05ed6dd0f82f3529989402122b57e4f3e6abf041aea1ec82cd1bfefe50f7ad9"}}