{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WSUJZALD4LBCM6I5JBENO5EINP","short_pith_number":"pith:WSUJZALD","canonical_record":{"source":{"id":"1701.06210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"b143a616738a71c912c7b16b7cc04e427cd8ee5deaaaa4c1a019793f0b77da1d","abstract_canon_sha256":"fc89de2f85a053f59d4ebf4640fd714b47911435378743188c3c9365a1d83da9"},"schema_version":"1.0"},"canonical_sha256":"b4a89c8163e2c226791d4848d774886bd84ecfd0430d2a12db83da3c4ad13cc6","source":{"kind":"arxiv","id":"1701.06210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06210","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06210v2","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06210","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"WSUJZALD4LBC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSUJZALD4LBCM6I5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSUJZALD","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WSUJZALD4LBCM6I5JBENO5EINP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"b143a616738a71c912c7b16b7cc04e427cd8ee5deaaaa4c1a019793f0b77da1d","abstract_canon_sha256":"fc89de2f85a053f59d4ebf4640fd714b47911435378743188c3c9365a1d83da9"},"schema_version":"1.0"},"canonical_sha256":"b4a89c8163e2c226791d4848d774886bd84ecfd0430d2a12db83da3c4ad13cc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:26.292800Z","signature_b64":"F5F2vOolVxCmeL66yrXGmromlEaKp9UZ5+ReHLwYkXHHkqp0mc/q8AOEzLWo1/wfr+u2AaeGVE4GbepSPu+PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a89c8163e2c226791d4848d774886bd84ecfd0430d2a12db83da3c4ad13cc6","last_reissued_at":"2026-05-18T00:47:26.292134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:26.292134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06210","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:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRhkbGSAo5Qu2rQdyHYHzbzhTwCdmwRGj2PwKfgyCmfexYHNIe/9pv406skXi+x6Dxy652Ih+MzqGVBaC22/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:07.677939Z"},"content_sha256":"b78cec309c6b3c9a8e7aa0547af2bae16c836aa0f1a752806cd626a5ad3fa0c5","schema_version":"1.0","event_id":"sha256:b78cec309c6b3c9a8e7aa0547af2bae16c836aa0f1a752806cd626a5ad3fa0c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WSUJZALD4LBCM6I5JBENO5EINP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the vertex degrees of the skeleton of the matching polytope of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Henrique do Nascimento, Laura Patuzzi, Liliana Costa, Nair Abreu","submitted_at":"2017-01-22T19:20:50Z","abstract_excerpt":"The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is the skeleton of the matching polytope of G, denoted G(M(G)). Since the number of vertices of G(M(G)) is huge, the structural properties of these graphs have been studied in particular classes. In this paper, for an arbitrary graph G, we obtain a formulae to compute the degree of a vertex of G(M(G)) and prove that the minimum degree of G(M(G)) is equal to the number of edges of G. Also, we identify"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06210","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:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJCnVKFNiyQVuj4ELLjW46UsQ9s8TFTfOM1QB4UQ3NPuGawA1EZNS0YaqYbqUg4F2/UhQjlbbLS41MxYrA7dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:07.678757Z"},"content_sha256":"a082aafd6fda26a16e111dbda54177a2a13778697e705fdbf252fe48400a04c4","schema_version":"1.0","event_id":"sha256:a082aafd6fda26a16e111dbda54177a2a13778697e705fdbf252fe48400a04c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSUJZALD4LBCM6I5JBENO5EINP/bundle.json","state_url":"https://pith.science/pith/WSUJZALD4LBCM6I5JBENO5EINP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSUJZALD4LBCM6I5JBENO5EINP/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-05-31T20:30:07Z","links":{"resolver":"https://pith.science/pith/WSUJZALD4LBCM6I5JBENO5EINP","bundle":"https://pith.science/pith/WSUJZALD4LBCM6I5JBENO5EINP/bundle.json","state":"https://pith.science/pith/WSUJZALD4LBCM6I5JBENO5EINP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSUJZALD4LBCM6I5JBENO5EINP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WSUJZALD4LBCM6I5JBENO5EINP","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":"fc89de2f85a053f59d4ebf4640fd714b47911435378743188c3c9365a1d83da9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:20:50Z","title_canon_sha256":"b143a616738a71c912c7b16b7cc04e427cd8ee5deaaaa4c1a019793f0b77da1d"},"schema_version":"1.0","source":{"id":"1701.06210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06210","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06210v2","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06210","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"WSUJZALD4LBC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSUJZALD4LBCM6I5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSUJZALD","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:a082aafd6fda26a16e111dbda54177a2a13778697e705fdbf252fe48400a04c4","target":"graph","created_at":"2026-05-18T00:47:26Z","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":"The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is the skeleton of the matching polytope of G, denoted G(M(G)). Since the number of vertices of G(M(G)) is huge, the structural properties of these graphs have been studied in particular classes. In this paper, for an arbitrary graph G, we obtain a formulae to compute the degree of a vertex of G(M(G)) and prove that the minimum degree of G(M(G)) is equal to the number of edges of G. Also, we identify","authors_text":"Carlos Henrique do Nascimento, Laura Patuzzi, Liliana Costa, Nair Abreu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:20:50Z","title":"On the vertex degrees of the skeleton of the matching polytope of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06210","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:b78cec309c6b3c9a8e7aa0547af2bae16c836aa0f1a752806cd626a5ad3fa0c5","target":"record","created_at":"2026-05-18T00:47:26Z","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":"fc89de2f85a053f59d4ebf4640fd714b47911435378743188c3c9365a1d83da9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:20:50Z","title_canon_sha256":"b143a616738a71c912c7b16b7cc04e427cd8ee5deaaaa4c1a019793f0b77da1d"},"schema_version":"1.0","source":{"id":"1701.06210","kind":"arxiv","version":2}},"canonical_sha256":"b4a89c8163e2c226791d4848d774886bd84ecfd0430d2a12db83da3c4ad13cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4a89c8163e2c226791d4848d774886bd84ecfd0430d2a12db83da3c4ad13cc6","first_computed_at":"2026-05-18T00:47:26.292134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:26.292134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F5F2vOolVxCmeL66yrXGmromlEaKp9UZ5+ReHLwYkXHHkqp0mc/q8AOEzLWo1/wfr+u2AaeGVE4GbepSPu+PAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:26.292800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b78cec309c6b3c9a8e7aa0547af2bae16c836aa0f1a752806cd626a5ad3fa0c5","sha256:a082aafd6fda26a16e111dbda54177a2a13778697e705fdbf252fe48400a04c4"],"state_sha256":"599739a06fd181eac9596594bbd9a3d9b49c0a58d01d8ea9e6e988ca214a9c3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PneE9c+HdNYcBjUeDdWhwICwgdock+m1BdrJMSnnq/tSFaAj/juNapOuJ0KSa50C6J7Ciz0TS7KcRExcNGiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:30:07.684089Z","bundle_sha256":"369ed9e94bf426e94847ba8103c50f59d2eed04b4110d4090041732d34ac4d09"}}