{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZR2Y3NI3TPTLRSTS6LGW2VEJGP","short_pith_number":"pith:ZR2Y3NI3","schema_version":"1.0","canonical_sha256":"cc758db51b9be6b8ca72f2cd6d548933c8cb0dab4fb300e841711a2ce321cb1c","source":{"kind":"arxiv","id":"1401.1596","version":1},"attestation_state":"computed","paper":{"title":"The Merrifield-Simmons conjecture also holds for parity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Trinks","submitted_at":"2014-01-08T08:11:33Z","abstract_excerpt":"The Merrifield-Simmons conjectures states a relation between the distance of vertices in a simple graph $G$ and the number of independent sets, denoted as $\\sigma(G)$, in vertex-deleted subgraphs. Namely, that the sign of the term $\\sigma(G_{-u}) \\cdot \\sigma(G_{-v}) - \\sigma(G) \\cdot \\sigma(G_{-u-v})$ only depends on the parity of the distance of $u$ and $v$ in $G$. We prove this statement in the case of parity graphs and give some evidence that this result may not be further generalized to other classes of graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.1596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T08:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"5c42d0f039cc8be44183af112d8c59fb3f64ecf2fe682927176838629e43b17a","abstract_canon_sha256":"094e8dcccc565e4dc642c6ac35d9038ccf00487b51080054d39634fb280ea3d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:58.466633Z","signature_b64":"J+htNJrBrGKC1YzZGzLluX2QRpdt3B6znlX0kcS/wvlLX1iX+ORNj+tAEtQm5eIi/d4xsW6D0+tufwg96VxuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc758db51b9be6b8ca72f2cd6d548933c8cb0dab4fb300e841711a2ce321cb1c","last_reissued_at":"2026-05-18T03:02:58.465898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:58.465898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Merrifield-Simmons conjecture also holds for parity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Trinks","submitted_at":"2014-01-08T08:11:33Z","abstract_excerpt":"The Merrifield-Simmons conjectures states a relation between the distance of vertices in a simple graph $G$ and the number of independent sets, denoted as $\\sigma(G)$, in vertex-deleted subgraphs. Namely, that the sign of the term $\\sigma(G_{-u}) \\cdot \\sigma(G_{-v}) - \\sigma(G) \\cdot \\sigma(G_{-u-v})$ only depends on the parity of the distance of $u$ and $v$ in $G$. We prove this statement in the case of parity graphs and give some evidence that this result may not be further generalized to other classes of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1596","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.1596","created_at":"2026-05-18T03:02:58.466006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1596v1","created_at":"2026-05-18T03:02:58.466006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1596","created_at":"2026-05-18T03:02:58.466006+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZR2Y3NI3TPTL","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZR2Y3NI3TPTLRSTS","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZR2Y3NI3","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP","json":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP.json","graph_json":"https://pith.science/api/pith-number/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/graph.json","events_json":"https://pith.science/api/pith-number/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/events.json","paper":"https://pith.science/paper/ZR2Y3NI3"},"agent_actions":{"view_html":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP","download_json":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP.json","view_paper":"https://pith.science/paper/ZR2Y3NI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1596&json=true","fetch_graph":"https://pith.science/api/pith-number/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/action/storage_attestation","attest_author":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/action/author_attestation","sign_citation":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/action/citation_signature","submit_replication":"https://pith.science/pith/ZR2Y3NI3TPTLRSTS6LGW2VEJGP/action/replication_record"}},"created_at":"2026-05-18T03:02:58.466006+00:00","updated_at":"2026-05-18T03:02:58.466006+00:00"}