{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6NK43TLQEVRB3VWGTP3XDM4RUG","short_pith_number":"pith:6NK43TLQ","canonical_record":{"source":{"id":"2207.05386","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-12T08:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"ef978d2cacc6f74f7e9d3eaa106c6e12d488eeda77b77b61706c8c7a967a2a9e","abstract_canon_sha256":"0ab3843df806f76f87589e5e1105e8ab89a07b6189714e9e41c7d1344a151909"},"schema_version":"1.0"},"canonical_sha256":"f355cdcd7025621dd6c69bf771b391a1a66ebecee8cab639498e69e7dba6a16f","source":{"kind":"arxiv","id":"2207.05386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05386","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05386v2","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05386","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"6NK43TLQEVRB","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_16","alias_value":"6NK43TLQEVRB3VWG","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_8","alias_value":"6NK43TLQ","created_at":"2026-07-05T06:01:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6NK43TLQEVRB3VWGTP3XDM4RUG","target":"record","payload":{"canonical_record":{"source":{"id":"2207.05386","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-12T08:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"ef978d2cacc6f74f7e9d3eaa106c6e12d488eeda77b77b61706c8c7a967a2a9e","abstract_canon_sha256":"0ab3843df806f76f87589e5e1105e8ab89a07b6189714e9e41c7d1344a151909"},"schema_version":"1.0"},"canonical_sha256":"f355cdcd7025621dd6c69bf771b391a1a66ebecee8cab639498e69e7dba6a16f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:12.213548Z","signature_b64":"YewW6xO9ZUwfIbNs3gWKv7gmjg+dwDDGNM8CaWlztiPQSwk9YYMk17CiE4jZ2QFA4IaggRYHW1KF+S8nZvFFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f355cdcd7025621dd6c69bf771b391a1a66ebecee8cab639498e69e7dba6a16f","last_reissued_at":"2026-07-05T06:01:12.213007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:12.213007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.05386","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-05T06:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNz5nNvLF2NlYDHIWBg3nFCvfdDd2rfZw0w/iAoRc5jVq28SBQeVixK/aq1Ur+LXqS5DWQdea6RDLJUukB+CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:55:57.863156Z"},"content_sha256":"db106128c0bbe7d93901342f1632265676f52f3f680533c4f159d916c122a500","schema_version":"1.0","event_id":"sha256:db106128c0bbe7d93901342f1632265676f52f3f680533c4f159d916c122a500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6NK43TLQEVRB3VWGTP3XDM4RUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph tilings in incompatibility systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Hao Li, Jie Hu, Yue Wang","submitted_at":"2022-07-12T08:32:26Z","abstract_excerpt":"An \\emph{incompatibility system} $(G,\\mathcal{F})$ consists of a graph $G$ and a family $\\mathcal{F}=\\{F_v\\}_{v\\in V(G)}$ over $G$ with $F_v\\subseteq \\{\\{e,e'\\}\\in {E(G)\\choose 2}: e\\cap e'=\\{v\\}\\}$. We say that two edges $e,e'\\in E(G)$ are \\emph{incompatible} if $\\{e,e'\\}\\in F_v$ for some $v\\in V(G)$, and otherwise \\emph{compatible}. A subgraph $H$ of $G$ is \\emph{compatible} if every pair of edges in $H$ are compatible. An incompatibility system $(G,\\mathcal{F})$ is \\emph{$\\Delta$-bounded} if for any vertex $v$ and any edge $e$ incident with $v$, there are at most $\\Delta$ members of $F_v$ c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05386","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/2207.05386/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-05T06:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lj+P9caJMJQcBzqZltnXdWaLCkDzVvpWETRGA6+ARaPQ70Xfy1bp73WvG5U2PV5Zs0aFrlbF0/YbOdY74strCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:55:57.863703Z"},"content_sha256":"680f157b7635cfc131e96924b3e439253c6c138dfa11db9c4db778ae58f76f66","schema_version":"1.0","event_id":"sha256:680f157b7635cfc131e96924b3e439253c6c138dfa11db9c4db778ae58f76f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/bundle.json","state_url":"https://pith.science/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/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-07T06:55:57Z","links":{"resolver":"https://pith.science/pith/6NK43TLQEVRB3VWGTP3XDM4RUG","bundle":"https://pith.science/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/bundle.json","state":"https://pith.science/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NK43TLQEVRB3VWGTP3XDM4RUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6NK43TLQEVRB3VWGTP3XDM4RUG","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":"0ab3843df806f76f87589e5e1105e8ab89a07b6189714e9e41c7d1344a151909","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-12T08:32:26Z","title_canon_sha256":"ef978d2cacc6f74f7e9d3eaa106c6e12d488eeda77b77b61706c8c7a967a2a9e"},"schema_version":"1.0","source":{"id":"2207.05386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05386","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05386v2","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05386","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"6NK43TLQEVRB","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_16","alias_value":"6NK43TLQEVRB3VWG","created_at":"2026-07-05T06:01:12Z"},{"alias_kind":"pith_short_8","alias_value":"6NK43TLQ","created_at":"2026-07-05T06:01:12Z"}],"graph_snapshots":[{"event_id":"sha256:680f157b7635cfc131e96924b3e439253c6c138dfa11db9c4db778ae58f76f66","target":"graph","created_at":"2026-07-05T06:01:12Z","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/2207.05386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An \\emph{incompatibility system} $(G,\\mathcal{F})$ consists of a graph $G$ and a family $\\mathcal{F}=\\{F_v\\}_{v\\in V(G)}$ over $G$ with $F_v\\subseteq \\{\\{e,e'\\}\\in {E(G)\\choose 2}: e\\cap e'=\\{v\\}\\}$. We say that two edges $e,e'\\in E(G)$ are \\emph{incompatible} if $\\{e,e'\\}\\in F_v$ for some $v\\in V(G)$, and otherwise \\emph{compatible}. A subgraph $H$ of $G$ is \\emph{compatible} if every pair of edges in $H$ are compatible. An incompatibility system $(G,\\mathcal{F})$ is \\emph{$\\Delta$-bounded} if for any vertex $v$ and any edge $e$ incident with $v$, there are at most $\\Delta$ members of $F_v$ c","authors_text":"Donglei Yang, Hao Li, Jie Hu, Yue Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-12T08:32:26Z","title":"Graph tilings in incompatibility systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05386","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:db106128c0bbe7d93901342f1632265676f52f3f680533c4f159d916c122a500","target":"record","created_at":"2026-07-05T06:01:12Z","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":"0ab3843df806f76f87589e5e1105e8ab89a07b6189714e9e41c7d1344a151909","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-12T08:32:26Z","title_canon_sha256":"ef978d2cacc6f74f7e9d3eaa106c6e12d488eeda77b77b61706c8c7a967a2a9e"},"schema_version":"1.0","source":{"id":"2207.05386","kind":"arxiv","version":2}},"canonical_sha256":"f355cdcd7025621dd6c69bf771b391a1a66ebecee8cab639498e69e7dba6a16f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f355cdcd7025621dd6c69bf771b391a1a66ebecee8cab639498e69e7dba6a16f","first_computed_at":"2026-07-05T06:01:12.213007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:01:12.213007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YewW6xO9ZUwfIbNs3gWKv7gmjg+dwDDGNM8CaWlztiPQSwk9YYMk17CiE4jZ2QFA4IaggRYHW1KF+S8nZvFFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:01:12.213548Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.05386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db106128c0bbe7d93901342f1632265676f52f3f680533c4f159d916c122a500","sha256:680f157b7635cfc131e96924b3e439253c6c138dfa11db9c4db778ae58f76f66"],"state_sha256":"90e4a3e9239ce37093540eff8c46d2c318321c108f719ca6430b629021b353e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xh3uVAi3lusEj0IEAtKX9onnm0ZqMg+OXv1sUkiha18KwYFbAGtCBXbXgvDmyA/YJWzqtdfA/H7lQgXbelCiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:55:57.867216Z","bundle_sha256":"0cb4720a01b35b27fafeed924cbf1af190137f0eb32df13af58623ef48351a4a"}}