{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LCCPNUNYNMIYVJL4YIRB2Q2FW7","short_pith_number":"pith:LCCPNUNY","canonical_record":{"source":{"id":"1908.07453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-19T01:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"19f7cf90597e317e1d69e7f58c91ce4d8d8a581488f73123f76ce344cb7133d0","abstract_canon_sha256":"9a51a6a7af9f45bb82b0670a2e0f46c8109c1592b0fd1c5aeb28bc2db792c928"},"schema_version":"1.0"},"canonical_sha256":"5884f6d1b86b118aa57cc2221d4345b7fec27800daa6e2e9b10130eb7d442e59","source":{"kind":"arxiv","id":"1908.07453","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07453","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07453v3","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07453","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"LCCPNUNYNMIY","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"LCCPNUNYNMIYVJL4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"LCCPNUNY","created_at":"2026-07-05T04:34:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LCCPNUNYNMIYVJL4YIRB2Q2FW7","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-19T01:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"19f7cf90597e317e1d69e7f58c91ce4d8d8a581488f73123f76ce344cb7133d0","abstract_canon_sha256":"9a51a6a7af9f45bb82b0670a2e0f46c8109c1592b0fd1c5aeb28bc2db792c928"},"schema_version":"1.0"},"canonical_sha256":"5884f6d1b86b118aa57cc2221d4345b7fec27800daa6e2e9b10130eb7d442e59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:25.023723Z","signature_b64":"tqOPJ6HGYNg2luuT8/dVBOM2ekNqDomBoxYAytkRAboOYP2KtjgtNE2aFk8VLwEKVm9B2SmykcDIibK7A6kOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5884f6d1b86b118aa57cc2221d4345b7fec27800daa6e2e9b10130eb7d442e59","last_reissued_at":"2026-07-05T04:34:25.023351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:25.023351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07453","source_version":3,"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-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74rnsinVGnXbOUaMO8oPUDbD0yzTdhpzZ1AcC2f6f0WFhkUC2/mI7Y8HdgVa0tq8gWJjaLnYgMuLthCUYytKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:37:11.645078Z"},"content_sha256":"00511f8f18d11d8cbdfc26d1c4c657b2ce127892b14ff8259b0b78bc0447169d","schema_version":"1.0","event_id":"sha256:00511f8f18d11d8cbdfc26d1c4c657b2ce127892b14ff8259b0b78bc0447169d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LCCPNUNYNMIYVJL4YIRB2Q2FW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some results on concatenating bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Hompe","submitted_at":"2019-08-19T01:06:42Z","abstract_excerpt":"We consider two functions $\\phi$ and $\\psi$, defined as follows. Let $x,y \\in (0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbors in $B$, and every vertex in $B$ has at least $y|C|$ neighbors in $C$. We denote by $\\phi(x,y)$ the maximum $z$ such that, in all such graphs $G$, there is a vertex $v \\in C$ that is joined to at least $z|A|$ vertices in $A$ by two-edge paths. If in addition we require that every vertex in $B$ has at least $x|A|$ neighbors in $A$, and every vertex in $C$ has at least $y|B|$ neighbors in $C$, we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07453","kind":"arxiv","version":3},"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/1908.07453/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-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POYkootQGWG0ijLhScNs3kEdsasjKxrt9PPSj7J2jw4qq5FPhwma9T2bOAd2PXKbI3CKQkzYxDlOUttEtMb2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:37:11.645721Z"},"content_sha256":"082c2f37077d9047260159802390eeef92070923fb75f28c5fde1c0d78a72a42","schema_version":"1.0","event_id":"sha256:082c2f37077d9047260159802390eeef92070923fb75f28c5fde1c0d78a72a42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/bundle.json","state_url":"https://pith.science/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/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-16T22:37:11Z","links":{"resolver":"https://pith.science/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7","bundle":"https://pith.science/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/bundle.json","state":"https://pith.science/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCCPNUNYNMIYVJL4YIRB2Q2FW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LCCPNUNYNMIYVJL4YIRB2Q2FW7","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":"9a51a6a7af9f45bb82b0670a2e0f46c8109c1592b0fd1c5aeb28bc2db792c928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-19T01:06:42Z","title_canon_sha256":"19f7cf90597e317e1d69e7f58c91ce4d8d8a581488f73123f76ce344cb7133d0"},"schema_version":"1.0","source":{"id":"1908.07453","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07453","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07453v3","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07453","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"LCCPNUNYNMIY","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"LCCPNUNYNMIYVJL4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"LCCPNUNY","created_at":"2026-07-05T04:34:25Z"}],"graph_snapshots":[{"event_id":"sha256:082c2f37077d9047260159802390eeef92070923fb75f28c5fde1c0d78a72a42","target":"graph","created_at":"2026-07-05T04:34: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider two functions $\\phi$ and $\\psi$, defined as follows. Let $x,y \\in (0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbors in $B$, and every vertex in $B$ has at least $y|C|$ neighbors in $C$. We denote by $\\phi(x,y)$ the maximum $z$ such that, in all such graphs $G$, there is a vertex $v \\in C$ that is joined to at least $z|A|$ vertices in $A$ by two-edge paths. If in addition we require that every vertex in $B$ has at least $x|A|$ neighbors in $A$, and every vertex in $C$ has at least $y|B|$ neighbors in $C$, we d","authors_text":"Patrick Hompe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-19T01:06:42Z","title":"Some results on concatenating bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07453","kind":"arxiv","version":3},"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:00511f8f18d11d8cbdfc26d1c4c657b2ce127892b14ff8259b0b78bc0447169d","target":"record","created_at":"2026-07-05T04:34: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":"9a51a6a7af9f45bb82b0670a2e0f46c8109c1592b0fd1c5aeb28bc2db792c928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-19T01:06:42Z","title_canon_sha256":"19f7cf90597e317e1d69e7f58c91ce4d8d8a581488f73123f76ce344cb7133d0"},"schema_version":"1.0","source":{"id":"1908.07453","kind":"arxiv","version":3}},"canonical_sha256":"5884f6d1b86b118aa57cc2221d4345b7fec27800daa6e2e9b10130eb7d442e59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5884f6d1b86b118aa57cc2221d4345b7fec27800daa6e2e9b10130eb7d442e59","first_computed_at":"2026-07-05T04:34:25.023351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:25.023351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqOPJ6HGYNg2luuT8/dVBOM2ekNqDomBoxYAytkRAboOYP2KtjgtNE2aFk8VLwEKVm9B2SmykcDIibK7A6kOBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:25.023723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07453","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00511f8f18d11d8cbdfc26d1c4c657b2ce127892b14ff8259b0b78bc0447169d","sha256:082c2f37077d9047260159802390eeef92070923fb75f28c5fde1c0d78a72a42"],"state_sha256":"d2256c4be748ebebfb029729fa7612c5a61df9dc6cfb0adf23e52cd9bb1e7c33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VDeCmPMEp88bQMz7T1pGXc3bD2vDYBUR1Zixe8kvNPerRTnVVjBknGCnOziDb68tawTl0jYeWMSCHHlpzvYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:37:11.649177Z","bundle_sha256":"69fc45fb9b3cfc3bf7ede4babba250cc3b59dc074662bbccdb845c2b86970d07"}}