{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IPB4IMGNHEF5DGOW4CISCWTKDJ","short_pith_number":"pith:IPB4IMGN","schema_version":"1.0","canonical_sha256":"43c3c430cd390bd199d6e091215a6a1a4cb16da9cd78d924086e2f307a08fd45","source":{"kind":"arxiv","id":"1504.03500","version":2},"attestation_state":"computed","paper":{"title":"Flows and bisections in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo, Louis Esperet, Michael Tarsi","submitted_at":"2015-04-14T11:46:18Z","abstract_excerpt":"A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$ vertices. This notion can be viewed as a relaxed version of nowhere-zero flows, as it directly follows from old results of Jaeger that every cubic graph $G$ with a circular nowhere-zero $r$-flow has a $\\lfloor r \\rfloor$-weak bisection. In this paper we study problems related to the existence of $k$-weak bisections. We believe that every cubic graph which ha"},"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":"1504.03500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-14T11:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"3bd6f9c439f43982b55d5dff265c7b52a52b9d768bb6411377276f98ca640bb8","abstract_canon_sha256":"c9b7ef101c9c172ab2c1670098bbcd4df79bbc20cdeb3c05f4b73214f03f34e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.169978Z","signature_b64":"8QGa9Yd9CXGC0FEzTJZJduw2k4xKwpIHhgXqPJpu9A2KM6iwJlxXpf4J5kcP6hHwhDAaNKB+MkCZS3bvg0KzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c3c430cd390bd199d6e091215a6a1a4cb16da9cd78d924086e2f307a08fd45","last_reissued_at":"2026-05-18T00:35:14.169528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.169528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flows and bisections in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo, Louis Esperet, Michael Tarsi","submitted_at":"2015-04-14T11:46:18Z","abstract_excerpt":"A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$ vertices. This notion can be viewed as a relaxed version of nowhere-zero flows, as it directly follows from old results of Jaeger that every cubic graph $G$ with a circular nowhere-zero $r$-flow has a $\\lfloor r \\rfloor$-weak bisection. In this paper we study problems related to the existence of $k$-weak bisections. We believe that every cubic graph which ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03500","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.03500","created_at":"2026-05-18T00:35:14.169592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03500v2","created_at":"2026-05-18T00:35:14.169592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03500","created_at":"2026-05-18T00:35:14.169592+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPB4IMGNHEF5","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPB4IMGNHEF5DGOW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPB4IMGN","created_at":"2026-05-18T12:29:25.134429+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/IPB4IMGNHEF5DGOW4CISCWTKDJ","json":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ.json","graph_json":"https://pith.science/api/pith-number/IPB4IMGNHEF5DGOW4CISCWTKDJ/graph.json","events_json":"https://pith.science/api/pith-number/IPB4IMGNHEF5DGOW4CISCWTKDJ/events.json","paper":"https://pith.science/paper/IPB4IMGN"},"agent_actions":{"view_html":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ","download_json":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ.json","view_paper":"https://pith.science/paper/IPB4IMGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03500&json=true","fetch_graph":"https://pith.science/api/pith-number/IPB4IMGNHEF5DGOW4CISCWTKDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IPB4IMGNHEF5DGOW4CISCWTKDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ/action/storage_attestation","attest_author":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ/action/author_attestation","sign_citation":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ/action/citation_signature","submit_replication":"https://pith.science/pith/IPB4IMGNHEF5DGOW4CISCWTKDJ/action/replication_record"}},"created_at":"2026-05-18T00:35:14.169592+00:00","updated_at":"2026-05-18T00:35:14.169592+00:00"}